1591 search results - page 141 / 319 » Random lifts of graphs |
167
click to vote
COLT
2005
Springer
16 years 1 hour ago
2005
Springer
In recent years manifold methods have attracted a considerable amount of attention in machine learning. However most algorithms in that class may be termed āmanifold-motivatedā...
173
click to vote
ESA
2004
Springer
15 years 12 months ago
2004
Springer
We obtain the following results related to dynamic versions of the shortest-paths problem: (i) Reductions that show that the incremental and decremental singlesource shortest-paths...
166
click to vote
SIROCCO
2010
15 years 8 months ago
2010
Abstract. We study strategies that minimize the instability of a faulttolerant consensus system. More precisely, we find the strategy than minimizes the number of output changes ov...
165
click to vote
COMBINATORICA
2007
15 years 6 months ago
2007
We derive a suļ¬cient condition for a sparse graph G on n vertices to contain a copy of a tree T of maximum degree at most d on (1 ā )n vertices, in terms of the expansion prop...
163
click to vote
MFCS
2004
Springer
15 years 11 months ago
2004
Springer
We study the on-line versions of two fundamental graph problems, maximum independent set and minimum coloring, for the case of disk graphs which are graphs resulting from intersect...