820 search results - page 108 / 164 » Inducing Temporal Graphs |
123
click to vote
FOCS
2002
IEEE
15 years 8 months ago
2002
IEEE
We consider the problem of learning a matching (i.e., a graph in which all vertices have degree 0 or 1) in a model where the only allowed operation is to query whether a set of ve...
140
Voted
CDC
2009
IEEE
15 years 8 months ago
2009
IEEE
Abstract— The present paper considers distributed consensus algorithms for agents evolving on a connected compact homogeneous (CCH) manifold. The agents track no external referen...
117
click to vote
GD
2009
Springer
15 years 8 months ago
2009
Springer
A graph G is a support for a hypergraph H = (V, S) if the vertices of G correspond to the vertices of H such that for each hyperedge Si ∈ S the subgraph of G induced by Si is co...
152
click to vote
COCOON
2000
Springer
15 years 7 months ago
2000
Springer
We consider the parameterized complexity of the following problem under the framework introduced by Downey and Fellows[4]: Given a graph G, an integer parameter k and a non-trivial...
132
Voted
ISLPED
1996
ACM
15 years 7 months ago
1996
ACM
We present a dynamic programming technique for solving the multiple supply voltage scheduling problem in both nonpipelined and functionally pipelined data-paths. The scheduling pro...