2252 search results - page 117 / 451 » Lower Bounds for Dynamic Algorithms |
110
click to vote
VRCAI
2006
ACM
15 years 9 months ago
2006
ACM
We present novel algorithms for updating bounding volume hierarchies of objects undergoing arbitrary deformations. Therefore, we introduce two new data structures, the kinetic AAB...
116
click to vote
SIROCCO
2010
15 years 4 months ago
2010
Abstract. Two mobile agents (robots) have to meet in an a priori unknown bounded terrain modeled as a polygon, possibly with polygonal obstacles. Robots are modeled as points, and ...
130
Voted
JAIR
2011
14 years 6 months ago
2011
We address the problem of computing approximate marginals in Gaussian probabilistic models by using mean field and fractional Bethe approximations. We define the Gaussian fracti...
ECCV
2004
Springer
16 years 5 months ago
2004
Springer
Abstract. A dynamic visual search framework based mainly on innerscene similarity is proposed. Algorithms as well as measures quantifying the difficulty of search tasks are suggest...
113
click to vote
EDCC
2008
Springer
15 years 5 months ago
2008
Springer
We present the design, correctness, and analysis of SONDe, a simple fully decentralized object deployment algorithm for highly requested systems. Given an object (service or data)...