1503 search results - page 250 / 301 » Self-optimizing distributed trees |
133
Voted
EDBT
2006
ACM
16 years 3 months ago
2006
ACM
Nearest neighbor (NN) queries have been extended from Euclidean spaces to road networks. Existing approaches are either based on Dijkstra-like network expansion or NN/distance prec...
114
click to vote
DCC
2002
IEEE
16 years 3 months ago
2002
IEEE
Let finite source and reproduction alphabets X and Y and a distortion measure d : X ? Y [0, ) be given. We study the minimum asymptotic rate required to describe a source distrib...
126
Voted
PPOPP
2010
ACM
16 years 19 days ago
2010
ACM
Irregular algorithms are organized around pointer-based data structures such as graphs and trees, and they are ubiquitous in applications. Recent work by the Galois project has pr...
117
Voted
PEPM
2010
ACM
16 years 8 days ago
2010
ACM
Duplicated code is a well known problem in software maintenance and refactoring. Code clones tend to increase program size and several studies have shown that duplicated code make...
142
Voted
NOCS
2009
IEEE
15 years 10 months ago
2009
IEEE
With the advent of Networks-on-Chip (NoCs), the interest for mesochronous synchronizers is again on the rise due to the intricacies of skew-controlled chip-wide clock tree distrib...