15485 search results - page 2593 / 3097 » Computing Optimal Subsets |
202
click to vote
TIT
2008
15 years 5 months ago
2008
We introduce a new state discrimination problem in which we are given additional information about the state after the measurement, or more generally, after a quantum memory bound ...
245
click to vote
ECCV
2010
Springer
15 years 5 months ago
2010
Springer
Visual tracking is one of the central problems in computer vision. A crucial problem of tracking is how to represent the object. Traditional appearance-based trackers are using inc...
210
click to vote
EGH
2010
Springer
15 years 5 months ago
2010
Springer
The k-D tree is a well-studied acceleration data structure for ray tracing. It is used to organize primitives in a scene to allow efficient execution of intersection operations be...
176
click to vote
FOCS
2010
IEEE
15 years 5 months ago
2010
IEEE
The Coin Problem is the following problem: a coin is given, which lands on head with probability either 1/2 + or 1/2 - . We are given the outcome of n independent tosses of this co...
211
click to vote
SSDBM
2010
IEEE
15 years 4 months ago
2010
IEEE
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...