1274 search results - page 186 / 255 » The Geometry of Coin-Weighing Problems |
187
click to vote
STOC
2006
ACM
16 years 6 months ago
2006
ACM
Range searching is among the most fundamental problems in computational geometry. An n-element point set in Rd is given along with an assignment of weights to these points from so...
170
click to vote
IROS
2009
IEEE
16 years 1 months ago
2009
IEEE
— The problem of accurate 6-DoF pose estimation of 3D objects based on their shape has so far been solved only for specific object geometries. Edge-based recognition and trackin...
175
click to vote
ATAL
2009
Springer
16 years 29 days ago
2009
Springer
In this paper we address the problem of decentralised coordination for agents that must make coordinated decisions over continuously valued control parameters (as is required in m...
189
click to vote
SIBGRAPI
2008
IEEE
16 years 23 days ago
2008
IEEE
Range searching is a fundamental problem in computational geometry. The problem involves preprocessing a set of n points in Rd into a data structure, so that it is possible to det...
158
click to vote
ISSAC
2007
Springer
16 years 16 days ago
2007
Springer
We discuss the parallelization of algorithms for solving polynomial systems symbolically by way of triangular decompositions. We introduce a component-level parallelism for which ...