2485 search results - page 105 / 497 » Time Bounded Frequency Computations |
144
click to vote
ESA
2004
Springer
15 years 10 months ago
2004
Springer
Edge contraction is shown to be a useful mechanism to improve lower bound heuristics for treewidth. A successful lower bound for treewidth is the degeneracy: the maximum over all ...
133
click to vote
SPAA
1996
ACM
15 years 9 months ago
1996
ACM
We analyze the relationship between the expected packet delay in rooted tree networks and the distribution of time needed for a packet to cross an edge using convexity-based stoch...
154
click to vote
ICPP
2007
IEEE
15 years 11 months ago
2007
IEEE
Performance and power are critical design constraints in today’s high-end computing systems. Reducing power consumption without impacting system performance is a challenge for t...
137
click to vote
STACS
2010
Springer
15 years 12 months ago
2010
Springer
The degree of a CSP instance is the maximum number of times that a variable may appear in the scope of constraints. We consider the approximate counting problem for Boolean CSPs wi...
135
click to vote
WADS
2005
Springer
15 years 10 months ago
2005
Springer
We analyze the performance of simple algorithms for matching two planar point sets under rigid transformations so as to minimize the directed Hausdorff distance between the sets....