5329 search results - page 236 / 1066 » The Weighted Majority Algorithm |
164
click to vote
DAM
2008
15 years 6 months ago
2008
We present a polynomial time algorithm to compute a minimum (weight) feedback vertex set for AT-free graphs, and extending this approach we obtain a polynomial time algorithm for ...
172
click to vote
CVPR
2005
IEEE
16 years 8 months ago
2005
IEEE
This paper presents a novel approach for estimating parameters for MRF-based stereo algorithms. This approach is based on a new formulation of stereo as a maximum a posterior (MAP...
201
click to vote
KDD
2008
ACM
16 years 7 months ago
2008
ACM
Attributed graphs are increasingly more common in many application domains such as chemistry, biology and text processing. A central issue in graph mining is how to collect inform...
189
click to vote
PERCOM
2006
ACM
16 years 6 months ago
2006
ACM
The irregularity in quality of wireless communication links poses significant research challenges in wireless sensor network design. Dynamic network conditions and environmental f...
168
click to vote
ESA
2005
Springer
16 years 2 days ago
2005
Springer
We introduce the Minimum-size bounded-capacity cut (MinSBCC) problem, in which we are given a graph with an identified source and seek to find a cut minimizing the number of node...