3131 search results - page 523 / 627 » Generalized connection caching |
190
click to vote
BMCBI
2011
14 years 10 months ago
2011
Background: Molecular database search tools need statistical models to assess the significance for the resulting hits. In the classical approach one asks the question how probable...
196
Voted
EDBT
2011
ACM
14 years 7 months ago
2011
ACM
Graph clustering has generally concerned itself with clustering undirected graphs; however the graphs from a number of important domains are essentially directed, e.g. networks of...
136
Voted
CRYPTO
2012
Springer
13 years 5 months ago
2012
Springer
A secret-sharing scheme realizes a graph if every two vertices connected by an edge can reconstruct the secret while every independent set in the graph does not get any informatio...
148
click to vote
CVPR
2004
IEEE
16 years 5 months ago
2004
IEEE
We pose the problem of 3D human tracking as one of inference in a graphical model. Unlike traditional kinematic tree representations, our model of the body is a collection of loos...
116
click to vote
ECCV
2002
Springer
16 years 5 months ago
2002
Springer
Sequential random sampling (`Markov Chain Monte-Carlo') is a popular strategy for many vision problems involving multimodal distributions over high-dimensional parameter spac...