1658 search results - page 75 / 332 » Learning Unknown Graphs |
215
click to vote
ICCV
2003
IEEE
16 years 6 months ago
2003
IEEE
Recent stereo algorithms have achieved impressive results by modelling the disparity image as a Markov Random Field (MRF). An important component of an MRF-based approach is the i...
136
click to vote
ECML
1998
Springer
15 years 9 months ago
1998
Springer
We present compelling evidence that the World Wide Web is a domain in which applications can benefit from using first-order learning methods, since the graph structure inherent in ...
143
Voted
CORR
2011
Springer
14 years 12 months ago
2011
Springer
We consider the problem of human-assisted graph search: given a directed acyclic graph with some (unknown) target node(s), we consider the problem of finding the target node(s) b...
131
click to vote
COCOON
2003
Springer
15 years 10 months ago
2003
Springer
We design efficient competitive algorithms for discovering hidden information using few queries. Specifically, consider a game in a given set of intervals (and their implied inte...
150
click to vote
DM
2010
15 years 5 months ago
2010
In the online F-avoidance edge-coloring game with r colors, a graph on n vertices is generated by at each stage randomly adding a new edge. The player must color each new edge as ...