Sciweavers

1347 search results - page 7 / 270
» On the Structure of the Minimum Time Function
Sort
View
FOCS
1998
IEEE
15 years 4 months ago
Parametric and Kinetic Minimum Spanning Trees
We consider the parametric minimum spanning tree problem, in which we are given a graph with edge weights that are linear functions of a parameter and wish to compute the sequenc...
Pankaj K. Agarwal, David Eppstein, Leonidas J. Gui...
SWAT
2004
Springer
153views Algorithms» more  SWAT 2004»
15 years 5 months ago
Melding Priority Queues
We show that any priority queue data structure that supports insert, delete, and find-min operations in pq(n) time, when n is an upper bound on the number of elements in the prio...
Ran Mendelson, Robert Endre Tarjan, Mikkel Thorup,...
TIT
2008
103views more  TIT 2008»
15 years 8 days ago
Fast Distributed Algorithms for Computing Separable Functions
The problem of computing functions of values at the nodes in a network in a fully distributed manner, where nodes do not have unique identities and make decisions based only on loc...
Damon Mosk-Aoyama, Devavrat Shah
ASPDAC
2007
ACM
98views Hardware» more  ASPDAC 2007»
15 years 4 months ago
Fast Analytic Placement using Minimum Cost Flow
Many current integrated circuits designs, such as those released for the ISPD2005[14] placement contest, are extremely large and can contain a great deal of white space. These new...
Ameya R. Agnihotri, Patrick H. Madden
62
Voted
ICASSP
2008
IEEE
15 years 6 months ago
Constrained nonlinear minimum mse estimation
We address the problem of minimum mean-squared error (MMSE) estimation where the estimator is constrained to belong to a prede ned set of functions. We derive a simple closed form...
Tomer Michaeli, Yonina C. Eldar