2004 search results - page 78 / 401 » Sampling from large graphs |
DM
2008
14 years 11 months ago
2008
We study graph colorings avoiding periodic sequences with large number of blocks on paths. The main problem is to decide, for a given class of graphs F, if there are absolute const...
150
click to vote
SDM
2012
SIAM
13 years 2 months ago
2012
SIAM
Low-rank approximations which are computed from selected rows and columns of a given data matrix have attracted considerable attention lately. They have been proposed as an altern...
108
click to vote
IEICET
2010
14 years 10 months ago
2010
We address the problem of perceived age estimation from face images, and propose a new semi-supervised approach involving two novel aspects. The first novelty is an efficient act...
APPROX
2007
Springer
15 years 6 months ago
2007
Springer
Consider a scenario where one desires to simulate the execution of some graph algorithm on random input graphs of huge, perhaps even exponential size. Sampling and storing these h...
NIPS
2007
15 years 1 months ago
2007
We investigate a family of inference problems on Markov models, where many sample paths are drawn from a Markov chain and partial information is revealed to an observer who attemp...