2899 search results - page 424 / 580 » On the Complexity of Exclusion Algorithms for Optimization |
154
click to vote
ICALP
2007
Springer
15 years 11 months ago
2007
Springer
We consider the problem of constructing efficient locally decodable codes in the presence of a computationally bounded adversary. Assuming the existence of one-way functions, we c...
131
click to vote
ISSAC
2007
Springer
15 years 11 months ago
2007
Springer
It is classical that univariate algebraic functions satisfy linear differential equations with polynomial coefficients. Linear recurrences follow for the coefficients of their po...
143
click to vote
CVPR
2006
IEEE
15 years 11 months ago
2006
IEEE
This paper describes a new approach to motion estimation in video. We represent video motion using a set of particles. Each particle is an image point sample with a longduration t...
128
click to vote
ISMVL
2006
IEEE
15 years 11 months ago
2006
IEEE
We define the MaxSAT problem for many-valued CNF formulas, called many-valued MaxSAT, and establish its complexity class. We then describe a basic branch and bound algorithm for ...
143
click to vote
P2P
2006
IEEE
15 years 11 months ago
2006
IEEE
Flat DHT architectures have been the main focus of the research on DHT design so far. However, there have been also a number of works proposing hierarchical DHT organizations and ...