2432 search results - page 360 / 487 » Degrees and choice numbers |
159
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Tree-based protocols are ubiquitous in distributed systems. They are flexible, they perform generally well, and, in static conditions, their analysis is mostly simple. Under churn...
143
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We consider minimal-rate sampling schemes for streams of delayed and weighted versions of a known pulse shape. Such signals belong to the class of finite rate of innovation (FRI) m...
177
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We give a simple polynomial-time algorithm to exactly count the number of Euler Tours (ETs) of any Eulerian generalized series-parallel graph, and show how to adapt this algorithm...
168
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Deciding whether a graph can be embedded in a grid using only unitlength edges is NP-complete, even when restricted to binary trees. However, it is not difficult to devise a numbe...
136
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We present a faster exponential-time algorithm for integer optimization over quasi-convex polynomials. We study the minimization of a quasiconvex polynomial subject to s quasi-con...