628 search results - page 92 / 126 » Approximation Algorithms for Quickest Spanning Tree Problems |
135
click to vote
ISPD
2009
ACM
15 years 9 months ago
2009
ACM
As VLSI technology moves to the 65nm node and beyond, interconnect delay greatly limits the circuit performance. As a critical component in interconnect synthesis, layer assignmen...
132
Voted
ICDCSW
2003
IEEE
15 years 8 months ago
2003
IEEE
Power conservation is a critical issue for ad hoc wireless networks. The main objective of the paper is to find the minimum uniform transmission power of an ad hoc wireless netwo...
121
Voted
CIKM
2006
Springer
15 years 6 months ago
2006
Springer
There has been a great amount of work on query-independent summarization of documents. However, due to the success of Web search engines query-specific document summarization (que...
144
Voted
COMPGEOM
2004
ACM
15 years 8 months 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...
141
Voted
COMPGEOM
2006
ACM
15 years 6 months ago
2006
ACM
Despite extensive study over the last four decades and numerous applications, no I/O-efficient algorithm is known for the union-find problem. In this paper we present an I/O-effic...