144 search results - page 8 / 29 » Sampling Techniques for Large, Dynamic Graphs |
NIPS
2003
14 years 11 months ago
2003
Rao–Blackwellization is an approximation technique for probabilistic inference that flexibly combines exact inference with sampling. It is useful in models where conditioning o...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Abstract--Breadth First Search (BFS) and other graph traversal techniques are widely used for measuring large unknown graphs, such as online social networks. It has been empiricall...
95
Voted
CSMR
2006
IEEE
15 years 3 months ago
2006
IEEE
A trace is a record of the execution of a computer program, showing the sequence of operations executed. A trace may be obtained through static or dynamic analysis. An object trac...
113
Voted
CVPR
2011
IEEE
14 years 5 months ago
2011
IEEE
Representing articulated objects as a graphical model has gained much popularity in recent years, often the root node of the graph describes the global position and orientation of...
MICRO
2008
IEEE
15 years 3 months ago
2008
IEEE
Heavyweight security analysis systems, such as taint analysis and dynamic type checking, are powerful technologies used to detect security vulnerabilities and software bugs. Tradi...