2004 search results - page 148 / 401 » Sampling from large graphs |
134
click to vote
SIBGRAPI
2006
IEEE
15 years 9 months ago
2006
IEEE
This paper addresses the problem of foreground extraction using active illumination and graph-cut optimization. Our approach starts by detecting image regions that are likely to b...
107
click to vote
KI
2009
Springer
15 years 9 months ago
2009
Springer
The article contributes a derivation of variational Bayes for a large class of topic models by generalising from the well-known model of latent Dirichcation. For an abstraction of ...
111
click to vote
CHI
2006
ACM
16 years 3 months ago
2006
ACM
As graph models are applied to more widely varying fields, researchers struggle with tools for exploring and analyzing these structures. We describe GUESS, a novel system for grap...
116
click to vote
ICSM
2009
IEEE
15 years 10 months ago
2009
IEEE
Program call graph representation can be used to support many tasks in compiler optimization, program comprehension, and software maintenance. During software evolution, the call ...
132
click to vote
COMBINATORICS
2007
15 years 3 months ago
2007
We investigate the notion of quantum chromatic number of a graph, which is the minimal number of colours necessary in a protocol in which two separated provers can convince a refe...