19 search results - page 2 / 4 » A Probabilistic Model for Correspondence Problems Using Rand... |
ADHOCNOW
2004
Springer
13 years 11 months ago
2004
Springer
Consider k particles, 1 red and k −1 white, chasing each other on the nodes of a graph G. If the red one catches one of the white, it “infects” it with its color. The newly ...
SPAA
2009
ACM
14 years 6 months ago
2009
ACM
Informative labeling schemes consist in labeling the nodes of graphs so that queries regarding any two nodes (e.g., are the two nodes adjacent?) can be answered by inspecting mere...
SIGIR
2006
ACM
13 years 11 months ago
2006
ACM
Traditional web link-based ranking schemes use a single score to measure a page’s authority without concern of the community from which that authority is derived. As a result, a...
SAT
2005
Springer
13 years 11 months ago
2005
Springer
An important extension of satisfiability testing is model-counting, a task that corresponds to problems such as probabilistic reasoning and computing the permanent of a Boolean ma...
ECCV
1998
Springer
14 years 7 months ago
1998
Springer
Assume that some objects are present in an image but can be seen only partially and are overlapping each other. To recognize the objects, we have to rstly separate the objects from...