4798 search results - page 369 / 960 » A Time for Change |
205
click to vote
KDD
2008
ACM
16 years 7 months ago
2008
ACM
Closed patterns are powerful representatives of frequent patterns, since they eliminate redundant information. We propose a new approach for mining closed unlabeled rooted trees a...
210
click to vote
TIT
2010
15 years 1 months ago
2010
The plenoptic function (Adelson and Bergen, 91) describes the visual information available to an observer at any point in space and time. Samples of the plenoptic function (POF) a...
180
Voted
ICCV
2005
IEEE
16 years 8 months ago
2005
IEEE
Object tracking is a challenging problems in real-time computer vision due to variations of lighting condition, pose, scale, and view-point over time. However, it is exceptionally...
222
click to vote
KDD
2007
ACM
16 years 7 months ago
2007
ACM
Existing data-stream clustering algorithms such as CluStream are based on k-means. These clustering algorithms are incompetent to find clusters of arbitrary shapes and cannot hand...
172
click to vote
APPROX
2009
Springer
16 years 1 months ago
2009
Springer
In this paper, we provide a polylogarithmic bound that holds with high probability on the insertion time for cuckoo hashing under the random-walk insertion method. Cuckoo hashing ...