258 search results - page 13 / 52 » New Lower Bounds for Heilbronn Numbers |
PODS
2004
ACM
14 years 7 months ago
2004
ACM
The important challenge of evaluating XPath queries over XML streams has sparked much interest in the past few years. A number of algorithms have been proposed, supporting wider f...
GLVLSI
2000
IEEE
14 years 13 hour ago
2000
IEEE
Transitions on high capacitance busses in VLSI systems result in considerable power dissipation. Various coding schemes have been proposed in literature to encode the input signal...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
In this paper we derive aggregate separation bounds, named after Davenport-MahlerMignotte (DMM), on the isolated roots of polynomial systems, specifically on the minimum distance ...
WAOA
2007
Springer
14 years 1 months ago
2007
Springer
For a connected graph G, let L(G) denote the maximum number of leaves in a spanning tree in G. The problem of computing L(G) is known to be NP-hard even for cubic graphs. We improv...
AAAI
2010
13 years 9 months ago
2010
Mini-Bucket Elimination (MBE) is a well-known approximation algorithm deriving lower and upper bounds on quantities of interest over graphical models. It relies on a procedure tha...