Sciweavers

884 search results - page 91 / 177
» Algorithms for Implicit Deformable Models
Sort
View
105
Voted
PADL
1999
Springer
15 years 5 months ago
Or-Parallelism within Tabling
Abstract. One important advantage of logic programming is that it allows the implicit exploitation of parallelism. Towards this goal, we suggest that or-parallelism can be efficien...
Ricardo Rocha, Fernando M. A. Silva, Vítor ...
90
Voted
AIPS
2009
15 years 1 months ago
Exploiting Coordination Locales in Distributed POMDPs via Social Model Shaping
Distributed POMDPs provide an expressive framework for modeling multiagent collaboration problems, but NEXPComplete complexity hinders their scalability and application in real-wo...
Pradeep Varakantham, Jun-young Kwak, Matthew E. Ta...
SIGGRAPH
2010
ACM
15 years 5 months ago
A novel algorithm for incompressible flow using only a coarse grid projection
Large scale fluid simulation can be difficult using existing techniques due to the high computational cost of using large grids. We present a novel technique for simulating deta...
Michael Lentine, Wen Zheng, Ronald Fedkiw
111
Voted
CVPR
2008
IEEE
16 years 2 months ago
Granularity and elasticity adaptation in visual tracking
The observation models in tracking algorithms are critical to both tracking performance and applicable scenarios but are often simplified to focus on fixed level of certain target...
Ming Yang, Ying Wu
130
Voted
ICIP
2008
IEEE
16 years 2 months ago
Conditional iterative decoding of Two Dimensional Hidden Markov Models
Two Dimensional Hidden Markov Models (2D-HMMs) provide substantial benefits for many computer vision and image analysis applications. Many fundamental image analysis problems, inc...
Mehmet Emre Sargin, Alphan Altinok, Kenneth Rose, ...