1523 search results - page 285 / 305 » The Computational Complexity of Linear Optics |
162
click to vote
CVPR
2005
IEEE
16 years 7 months ago
2005
IEEE
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...
131
click to vote
ICPR
2008
IEEE
16 years 6 months ago
2008
IEEE
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...
153
click to vote
STOC
2003
ACM
16 years 5 months ago
2003
ACM
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...
150
click to vote
FOCS
2009
IEEE
15 years 12 months ago
2009
IEEE
— 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...
143
click to vote
SPAA
2005
ACM
15 years 10 months ago
2005
ACM
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...