1949 search results - page 178 / 390 » Random graphs on surfaces |
150
click to vote
GLOBECOM
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract—In this paper, we consider the problem of multifunctional compression with side information. The problem is how we can compress a source X so that the receiver is able t...
139
click to vote
TAMC
2009
Springer
15 years 11 months ago
2009
Springer
We study a new model of computation called stream checking on graph problems where a space-limited verifier has to verify a proof sequentially (i.e., it reads the proof as a strea...
130
click to vote
COLT
2005
Springer
15 years 10 months 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...
137
click to vote
ESA
2004
Springer
15 years 10 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...
141
click to vote
SIROCCO
2010
15 years 6 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...