2924 search results - page 360 / 585 » Lower Bounds in Distributed Computing |
137
click to vote
ICPR
2000
IEEE
16 years 5 months ago
2000
IEEE
This paper presents an algorithm, called the winnerupdate algorithm, for accelerating the nearest neighbor search. By constructing a hierarchical structure ,for each feature point...
124
Voted
COMPGEOM
2004
ACM
15 years 10 months ago
2004
ACM
We prove that the lines tangent to four possibly intersecting convex polyhedra in 3 with n edges in total form Θ(n2 ) connected components in the worst case. In the generic ca...
163
Voted
SIGGRAPH
2010
ACM
15 years 8 months ago
2010
ACM
Achieving interactive performance in cloth animation has significant implications in computer games and other interactive graphics applications. Although much progress has been m...
157
click to vote
CSR
2006
Springer
15 years 8 months ago
2006
Springer
We propose a new model of restricted branching programs specific to solving GEN problems, which we call incremental branching programs. We show that syntactic incremental branchin...
182
click to vote
GRAPHICSINTERFACE
2007
15 years 6 months ago
2007
Modeling 3D objects and scenes is an important part of computer graphics. One approach to modeling is projecting binary patterns onto the scene in order to obtain correspondences ...