2004 search results - page 133 / 401 » Sampling from large graphs |
131
click to vote
AI
2008
Springer
15 years 3 months ago
2008
Springer
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...
133
click to vote
IJCAI
2007
15 years 4 months ago
2007
Some Statistical Software Testing approaches rely on sampling the feasible paths in the control flow graph of the program; the difficulty comes from the tiny ratio of feasible p...
141
Voted
ICCV
2011
IEEE
14 years 3 months ago
2011
IEEE
We propose a mid-level statistical model for image segmentation that composes multiple figure-ground hypotheses (FG) obtained by applying constraints at different locations and s...
120
click to vote
TOG
2002
15 years 2 months ago
2002
The bidirectional texture function (BTF) is a 6D function that can describe textures arising from both spatially-variant surface reflectance and surface mesostructures. In this pa...
125
click to vote
ICML
2009
IEEE
16 years 4 months ago
2009
IEEE
We present a unified framework for learning link prediction and edge weight prediction functions in large networks, based on the transformation of a graph's algebraic spectru...