401 search results - page 40 / 81 » Algorithms for a Simple Point Placement Problem |
CDC
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract— This paper is concerned with the distributed averaging problem over a given undirected graph. To enable every vertex to compute the average of the initial numbers sitti...
114
click to vote
COMGEO
2008
ACM
14 years 12 months ago
2008
ACM
We consider algorithms for finding the optimal location of a simple transportation device, that we call a moving walkway, consisting of a pair of points in the plane between which ...
132
click to vote
ESA
1995
Springer
15 years 3 months ago
1995
Springer
An input to the betweenness problem contains m constraints over n real variables (points). Each constraint consists of three points, where one of the points is specified to lie in...
107
click to vote
SODA
2000
ACM
15 years 1 months ago
2000
ACM
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
103
click to vote
PAMI
2010
14 years 10 months ago
2010
While feature point recognition is a key component of modern approaches to object detection, existing approaches require computationally expensive patch preprocessing to handle pe...