Sciweavers

1523 search results - page 285 / 305
» The Computational Complexity of Linear Optics
Sort
View
CVPR
2005
IEEE
14 years 9 months ago
Efficient Mean-Shift Tracking via a New Similarity Measure
The mean shift algorithm has achieved considerable success in object tracking due to its simplicity and robustness. It finds local minima of a similarity measure between the color...
Changjiang Yang, Ramani Duraiswami, Larry S. Davis
ICPR
2008
IEEE
14 years 8 months ago
Efficient triangulation based on 3D Euclidean optimization
This paper presents a method for triangulation of 3D points given their projections in two images. Recent results show that the triangulation mapping can be represented as a linea...
Klas Nordberg
STOC
2003
ACM
171views Algorithms» more  STOC 2003»
14 years 7 months ago
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
Jochen Könemann, R. Ravi
FOCS
2009
IEEE
14 years 2 months ago
Reducibility among Fractional Stability Problems
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...
Shiva Kintali, Laura J. Poplawski, Rajmohan Rajara...
SPAA
2005
ACM
14 years 1 months ago
Fast construction of overlay networks
An asynchronous algorithm is described for rapidly constructing an overlay network in a peer-to-peer system where all nodes can in principle communicate with each other directly t...
Dana Angluin, James Aspnes, Jiang Chen, Yinghua Wu...