2944 search results - page 130 / 589 » Improving Bound Propagation |
ESA
2004
Springer
14 years 3 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 ...
SPAA
1993
ACM
14 years 2 months ago
1993
ACM
d Abstract) Thomas H. Cormen Leonard F. Wisniewski Department of Mathematics and Computer Science Dartmouth College We give asymptotically equal lower and upper bounds for the num...
COCO
2007
Springer
14 years 4 months ago
2007
Springer
This paper presents a unified and simple treatment of basic questions concerning two computational models: multiparty communication complexity and GF(2) polynomials. The key is t...
IPSN
2005
Springer
14 years 3 months ago
2005
Springer
We bound the number of sensors required to achieve a desired level of sensing accuracy in a discrete sensor network application (e.g. distributed detection). We model the state of...
PAMI
2006
13 years 10 months ago
2006
Algorithms for discrete energy minimization are of fundamental importance in computer vision. In this paper we focus on the recent technique proposed by Wainwright et al. [33] - t...