Sciweavers

614 search results - page 34 / 123
» Local Computation: Lower and Upper Bounds
Sort
View
WAOA
2007
Springer
170views Algorithms» more  WAOA 2007»
15 years 4 months ago
A 5/3-Approximation for Finding Spanning Trees with Many Leaves in Cubic Graphs
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...
José R. Correa, Cristina G. Fernandes, Mart...
MFCS
2010
Springer
14 years 8 months ago
Weights of Exact Threshold Functions
We consider Boolean exact threshold functions defined by linear equations, and in general degree d polynomials. We give upper and lower bounds on the maximum magnitude (absolute va...
László Babai, Kristoffer Arnsfelt Ha...
JAIR
2010
119views more  JAIR 2010»
14 years 8 months ago
Active Tuples-based Scheme for Bounding Posterior Beliefs
The paper presents a scheme for computing lower and upper bounds on the posterior marginals in Bayesian networks with discrete variables. Its power lies in its ability to use any ...
Bozhena Bidyuk, Rina Dechter, Emma Rollon
SPAA
1993
ACM
15 years 2 months ago
Asymptotically Tight Bounds for Performing BMMC Permutations on Parallel Disk Systems
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...
Thomas H. Cormen, Leonard F. Wisniewski
CAV
2007
Springer
112views Hardware» more  CAV 2007»
15 years 4 months ago
Magnifying-Lens Abstraction for Markov Decision Processes
ng-Lens Abstraction for Markov Decision Processes⋆ In Proc. of CAV 2007: 19th International Conference on Computer-Aided Verification, Lectures Notes in Computer Science. c Spri...
Luca de Alfaro, Pritam Roy