5153 search results - page 640 / 1031 » Introduction to Randomized Algorithms |
176
Voted
SIGMOD
2001
ACM
16 years 5 months ago
2001
ACM
In this paper, we investigate how to scale hierarchical clustering methods (such as OPTICS) to extremely large databases by utilizing data compression methods (such as BIRCH or ra...
163
Voted
ICCD
2008
IEEE
16 years 1 months ago
2008
IEEE
— The increasing viability of three dimensional (3D) silicon integration technology has opened new opportunities for chip architecture innovations. One direction is in the extens...
132
click to vote
INFOCOM
2008
IEEE
15 years 11 months ago
2008
IEEE
— Due to the increased usage of NAT boxes and firewalls, it has become harder for applications to establish direct connections seamlessly among two end-hosts. A recently adopted...
141
click to vote
CIVR
2007
Springer
15 years 11 months ago
2007
Springer
We present a novel matching and similarity evaluation method for planar geometric shapes represented by sets of polygonal curves. Given two shapes, the matching algorithm randomly...
151
Voted
INFOCOM
2005
IEEE
15 years 10 months ago
2005
IEEE
— We consider a scenario where a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing...