2430 search results - page 385 / 486 » Computing Tutte Polynomials |
148
click to vote
PODS
2001
ACM
16 years 3 months ago
2001
ACM
We consider the complexity of join problems, focusing on equijoins, spatial-overlap joins, and set-containment joins. We use a graph pebbling model to characterize these joins com...
102
Voted
PERCOM
2006
ACM
16 years 2 months ago
2006
ACM
A recent flooding algorithm [1] guaranteed correctness for networks with dynamic edges and fixed nodes. The algorithm provided a partial answer to the highly dynamic network (HDN)...
125
Voted
MOBIHOC
2002
ACM
16 years 2 months ago
2002
ACM
Topology control problems are concerned with the assignment of power values to the nodes of an ad hoc network so that the power assignment leads to a graph topology satisfying som...
127
click to vote
SODA
2010
ACM
16 years 22 days ago
2010
ACM
We develop (single-pass) streaming algorithms for maintaining extent measures of a stream S of n points in Rd . We focus on designing streaming algorithms whose working space is p...
118
click to vote
ICCAD
2003
IEEE
16 years 7 days ago
2003
IEEE
In this paper, we study the problem of retiming of sequential circuits with both interconnect and gate delay. Most retiming algorithms have assumed ideal conditions for the non-lo...