23 search results - page 3 / 5 » Computing an Optimal Layout for Cone Trees |
83
Voted
SIAMJO
2000
14 years 9 months ago
2000
We study the problem of minimizing a sum of p-norms where p is a fixed real number in the interval [1, ]. Several practical algorithms have been proposed to solve this problem. How...
102
click to vote
SIGMOD
2010
ACM
14 years 4 months ago
2010
ACM
In-memory tree structured index search is a fundamental database operation. Modern processors provide tremendous computing power by integrating multiple cores, each with wide vect...
73
Voted
MOBIDE
2010
ACM
14 years 9 months ago
2010
ACM
We propose a distributed algorithm to construct a balanced communication tree that serves in gathering data from the network nodes to a sink. Our algorithm constructs a near-optim...
DAC
2004
ACM
15 years 1 months ago
2004
ACM
The performance of timing-driven placement methods depends strongly on the choice of the net model. In this paper a more precise net model is presented that does not increase nume...
ICML
2008
IEEE
15 years 10 months ago
2008
IEEE
The problem of obtaining the maximum a posteriori (map) estimate of a discrete random field is of fundamental importance in many areas of Computer Science. In this work, we build ...