5448 search results - page 850 / 1090 » Breakpoints and Time in Distributed Computations |
239
click to vote
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
201
click to vote
ICPP
2002
IEEE
15 years 11 months ago
2002
IEEE
A software cache implements instruction and data caching entirely in software. Dynamic binary rewriting offers a means to specialize the software cache miss checks at cache miss t...
219
click to vote
SIGMOD
2010
ACM
15 years 11 months ago
2010
ACM
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...
160
click to vote
SIGUCCS
2000
ACM
15 years 11 months ago
2000
ACM
As colleges and universities are moving into the realm of providing Internet connections to the residence dormitories (ResNet), the local help desk is becoming the focal point for...
177
click to vote
APPROX
2006
Springer
15 years 10 months ago
2006
Springer
Motivated by applications in batch scheduling of jobs in manufacturing systems and distributed computing, we study two related problems. Given is a set of jobs {J1, . . . , Jn}, w...