3154 search results - page 486 / 631 » Computing Closed Skycubes |
170
click to vote
STOC
2005
ACM
16 years 6 months ago
2005
ACM
We present new explicit constructions of deterministic randomness extractors, dispersers and related objects. We say that a distribution X on binary strings of length n is a -sour...
163
click to vote
TCS
2011
15 years 1 months ago
2011
We formulate and study a new computational model for dynamic data. In this model, the data changes gradually and the goal of an algorithm is to compute the solution to some proble...
195
click to vote
CVPR
2004
IEEE
16 years 8 months ago
2004
IEEE
Coalescence, meaning the tracker associates more than one trajectories to some targets while loses track for others, is a challenging problem for visual tracking of multiple targe...
193
click to vote
CVPR
2006
IEEE
16 years 8 months ago
2006
IEEE
We consider the general problem of learning from both labeled and unlabeled data. Given a set of data points, only a few of them are labeled, and the remaining points are unlabele...
192
click to vote
CVPR
2006
IEEE
16 years 8 months ago
2006
IEEE
We consider visual category recognition in the framework of measuring similarities, or equivalently perceptual distances, to prototype examples of categories. This approach is qui...