2228 search results - page 106 / 446 » Distributed Data Clustering Can Be Efficient and Exact |
151
click to vote
ICDCS
1999
IEEE
15 years 11 months ago
1999
IEEE
We describe imprecise calendars, a way to organize and schedule clusters of nodes in a computation grid. Imprecise calendars permit the easy and efficient sharing of resources bet...
178
click to vote
WDAS
2000
15 years 8 months ago
2000
This paper reviews literature on scalable data structures for searching in a distributed computing environment. Starting with a system where one server manages a file of a given s...
180
click to vote
CGF
2002
15 years 6 months ago
2002
We present a method to efficiently construct and render a smooth surface for approximation of large functional scattered data. Using a subdivision surface framework and techniques...
172
click to vote
NIPS
1994
15 years 8 months ago
1994
We present efficient algorithms for dealing with the problem of missing inputs (incomplete feature vectors) during training and recall. Our approach is based on the approximation ...
179
click to vote
ICMCS
2006
IEEE
16 years 24 days ago
2006
IEEE
Systems designed to extract time-critical information from large volumes of unstructured data must include the ability, both from an architectural and algorithmic point of view, t...