3008 search results - page 544 / 602 » Independence in connected graphs |
208
click to vote
WADS
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. Many real-time embedded systems involve a collection of independently executing event-driven code blocks, having hard real-time constraints. Portions of such codes when t...
166
click to vote
KBSE
1995
IEEE
15 years 9 months ago
1995
IEEE
Numerical design optimization algorithms are highly sensitive to the particular formulation of the optimization problems they are given. The formulation of the search space, the o...
161
click to vote
STOC
2010
ACM
15 years 6 months ago
2010
ACM
Let h > w > 0 be two fixed integers. Let H be a random hypergraph whose hyperedges are uniformly of size h. To w-orient a hyperedge, we assign exactly w of its vertices posi...
184
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Signal modeling lies at the core of numerous signal and image processing applications. A recent approach that has drawn considerable attention is sparse representation modeling, in...
152
click to vote
EJC
2007
15 years 6 months ago
2007
Jim Propp’s P-machine, also known as the ‘rotor router model’ is a simple deterministic process that simulates a random walk on a graph. Instead of distributing chips to ran...