2745 search results - page 298 / 549 » A fast algorithm for computing large Fibonacci numbers |
168
Voted
PODC
1997
ACM
15 years 9 months ago
1997
ACM
Systems that store objects at a large number of sites require fault-tolerant and timely garbage collection. A popular technique is to trace each site independently using inter-sit...
125
click to vote
ICPR
2002
IEEE
16 years 6 months ago
2002
IEEE
We explore the idea of evidence accumulation for combining the results of multiple clusterings. Initially, n d-dimensional data is decomposed into a large number of compact cluste...
131
click to vote
UIST
2005
ACM
15 years 10 months ago
2005
ACM
We introduce PlayAnywhere, a front-projected computer vision-based interactive table system which uses a new commercially available projection technology to obtain a compact, self...
277
click to vote
ICDE
2009
IEEE
16 years 6 months ago
2009
IEEE
Modern database systems increasingly make use of networked storage. This storage can be in the form of SAN's or in the form of shared-nothing nodes in a cluster. One type of a...
142
click to vote
ECCV
2006
Springer
16 years 7 months ago
2006
Springer
Abstract. Foreground and background segmentation is a typical problem in computer vision and medical imaging. In this paper, we propose a new learning based approach for 3D segment...