2163 search results - page 234 / 433 » cases 2004 |
192
click to vote
ASPDAC
2004
ACM
16 years 1 days ago
2004
ACM
— The problem of minimizing dynamic power consumption by scaling down the supply voltage of computational elements off critical paths is widely addressed in the literature for th...
154
click to vote
COMPGEOM
2004
ACM
16 years 1 days ago
2004
ACM
We study the problem of computing the visibility graph defined by a set P of n points inside a polygon Q: two points p, q ∈ P are joined by an edge if the segment pq ⊂ Q. Ef...
204
click to vote
COMPGEOM
2004
ACM
16 years 1 days ago
2004
ACM
We present a novel Locality-Sensitive Hashing scheme for the Approximate Nearest Neighbor Problem under ÐÔ norm, based on Ôstable distributions. Our scheme improves the running...
203
click to vote
DIALM
2004
ACM
16 years 1 days ago
2004
ACM
Coping with mobility and dynamism is one of the biggest challenges in ad hoc networks. An essential requirement for such networks is a service that can establish communication ses...
148
click to vote
MSWIM
2004
ACM
16 years 1 days ago
2004
ACM
In case of natural disasters or intentional attacks, telecommunication networks often get heavily damaged and current resilience schemes have proven to be insufficient for rapid r...