6251 search results - page 950 / 1251 » Randomness, Computability, and Density |
200
click to vote
ICS
2010
Tsinghua U.
16 years 4 months ago
2010
Tsinghua U.
: We initiate the study of local, sublinear time algorithms for finding vertices with extreme topological properties -- such as high degree or clustering coefficient -- in large so...
199
click to vote
ICS
2010
Tsinghua U.
16 years 4 months ago
2010
Tsinghua U.
In this paper we study the possibility of proving the existence of one-way functions based on average case hardness. It is well-known that if there exists a polynomial-time sample...
234
click to vote
PAKDD
2009
ACM
16 years 4 months ago
2009
ACM
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-...
177
click to vote
CVPR
2010
IEEE
16 years 3 months ago
2010
IEEE
Active learning methods aim to select the most informative unlabeled instances to label first, and can help to focus image or video annotations on the examples that will most impr...
284
click to vote
CVPR
2010
IEEE
16 years 3 months ago
2010
IEEE
Tracking-by-detection is increasingly popular in order to tackle the visual tracking problem. Existing adaptive methods suffer from the drifting problem, since they rely on selfup...