198 search results - page 35 / 40 » A practical algorithm for constructing oblivious routing sch... |
198
click to vote
ISPD
2012
ACM
14 years 1 months ago
2012
ACM
In this paper, we propose a new approach for gated bus synthesis [16] with minimum wire capacitance per transaction in three-dimensional (3D) ICs. The 3D IC technology connects di...
147
click to vote
INFOCOM
2008
IEEE
16 years 6 days ago
2008
IEEE
—A large amount of algorithms has recently been designed for the Internet under the assumption that the distance defined by the round-trip delay (RTT) is a metric. Moreover, man...
173
click to vote
VIS
2004
IEEE
16 years 7 months ago
2004
IEEE
We present a new level set method for reconstructing interfaces from point aggregations. Although level-set-based methods are advantageous because they can handle complicated topo...
150
click to vote
SODA
2001
ACM
15 years 7 months ago
2001
ACM
Fast-converging methods for reconstructing phylogenetic trees require that the sequences characterizing the taxa be of only polynomial length, a major asset in practice, since rea...
336
click to vote
ICDE
2012
IEEE
13 years 8 months ago
2012
IEEE
We present a new Bi-level LSH algorithm to perform approximate k-nearest neighbor search in high dimensional spaces. Our formulation is based on a two-level scheme. In the first ...