2976 search results - page 96 / 596 » On the bounded integer programming |
91
Voted
CORR
2010
Springer
14 years 7 months ago
2010
Springer
This paper addresses the following questions for a given tree T and integer d 2: (1) What is the minimum number of degree-d subtrees that partition E(T)? (2) What is the minimum n...
73
Voted
TIT
2010
14 years 7 months ago
2010
Abstract--This paper discusses new bounds for restricted isometry constants in compressed sensing. Let 8be an n2p real matrix and k be a positive integer with k n. One of the main...
CORR
2010
Springer
15 years 19 days ago
2010
Springer
A class of graphs is nowhere dense if for every integer r there is a finite upper bound on the size of cliques that occur as (topological) r-minors. We observe that this tameness ...
144
Voted
SIAMCOMP
2010
14 years 7 months ago
2010
This paper studies the inherent trade-off between termination probability and total step complexity of randomized consensus algorithms. It shows that for every integer k, the prob...
FSTTCS
2005
Springer
15 years 6 months ago
2005
Springer
In this paper4 , we compare Timed Automata (TA) and Time Petri Nets (TPN) with respect to weak timed bisimilarity. It is already known that the class of bounded TPNs is strictly in...