Sciweavers

35419 search results - page 205 / 7084
» How are we doing
Sort
View
ACCV
2006
Springer
15 years 10 months ago
How to Compute the Pose of an Object Without a Direct View?
We consider the task of computing the pose of an object relative to a camera, for the case where the camera has no direct view of the object. This problem was encountered in work o...
Peter F. Sturm, Thomas Bonfort
COMPGEOM
2006
ACM
15 years 10 months ago
How to get close to the median shape
In this paper, we study the problem of L1-fitting a shape to a set of point, where the target is to minimize the sum of distances of the points to the shape, or alternatively the...
Sariel Har-Peled
MINENET
2006
ACM
15 years 10 months ago
How to extract BGP peering information from the internet routing registry
We describe an on-line service, and its underlying methodology, designed to extract BGP peerings from the Internet Routing Registry. Both the method and the service are based on: ...
Giuseppe Di Battista, Tiziana Refice, Massimo Rimo...
ICCV
2005
IEEE
15 years 10 months ago
How Hard is 3-View Triangulation Really?
We present a solution for optimal triangulation in three views. The solution is guaranteed to find the optimal solution because it computes all the stationary points of the (maxi...
Henrik Stewénius, Frederik Schaffalitzky, D...
ICALP
2005
Springer
15 years 10 months ago
How Well Can Primal-Dual and Local-Ratio Algorithms Perform?
We define an algorithmic paradigm, the stack model, that captures many primal-dual and local-ratio algorithms for approximating covering and packing problems. The stack model is ...
Allan Borodin, David Cashman, Avner Magen