7129 search results - page 1164 / 1426 » Approximation Algorithms for Treewidth |
157
Voted
CEC
2011
IEEE
14 years 3 months ago
2011
IEEE
—Stochastic relaxation aims at finding the minimum of a fitness function by identifying a proper sequence of distributions, in a given model, that minimize the expected value o...
128
Voted
STOC
2007
ACM
16 years 3 months ago
2007
ACM
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
145
click to vote
ECCV
2006
Springer
16 years 5 months ago
2006
Springer
Filtering based algorithms have become popular in tracking human body pose. Such algorithms can suffer the curse of dimensionality due to the high dimensionality of the pose state ...
150
Voted
ECCV
2002
Springer
16 years 5 months ago
2002
Springer
We investigate in this article the rigid registration of large sets of points, generally sampled from surfaces. We formulate this problem as a general Maximum-Likelihood (ML) estim...
102
Voted
STOC
2009
ACM
16 years 4 months ago
2009
ACM
One of the most fundamental problems in web search is how to re-rank result web pages based on user logs. Most traditional models for re-ranking assume each query has a single int...