SPAA
2010
ACM
14 years 4 months ago
2010
ACM
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
SPAA
2010
ACM
14 years 4 months ago
2010
ACM
Energy consumption by computer systems has emerged as an important concern. However, the energy consumed in executing an algorithm cannot be inferred from its performance alone: i...
PG
2002
IEEE
14 years 4 months ago
2002
IEEE
We present an algorithm for computing the distance between two free-form surfaces. Using line geometry, the distance computation is reformulated as a simple instance of a surface-...
ISVLSI
2002
IEEE
14 years 4 months ago
2002
IEEE
Retiming has been shown to be a powerful technique for improving the performance of synchronous circuits. However, even though retiming algorithms of polynomial time complexity ha...
INFOCOM
2002
IEEE
14 years 4 months ago
2002
IEEE
Abstract—Packet delay traces are important measurements for analyzing end-to-end performance and for designing traffic control algorithms in computer networks. Due to the fact t...
HASE
2002
IEEE
14 years 4 months ago
2002
IEEE
We present two classes of distributed algorithms called DRBA and DOBA, for decentralized, proactive resource allocation in asynchronous real-time distributed systems. The objectiv...
FOCS
2002
IEEE
14 years 4 months ago
2002
IEEE
We give the first polynomial time algorithm to learn any function of a constant number of halfspaces under the uniform distribution on the Boolean hypercube to within any constan...
FOCS
2002
IEEE
14 years 4 months ago
2002
IEEE
Two decades ago, Megiddo and Dyer showed that linear programming in two and three dimensions (and subsequently any constant number of dimensions) can be solved in linear time. In ...
PODS
2010
ACM
14 years 4 months ago
2010
ACM
We give the first optimal algorithm for estimating the number of distinct elements in a data stream, closing a long line of theoretical research on this problem begun by Flajolet...
COMPGEOM
2010
ACM
14 years 4 months ago
2010
ACM
Let P be a set of n points in R3 . The 2-center problem for P is to find two congruent balls of the minimum radius whose union covers P. We present two randomized algorithms for ...