Sciweavers

5316 search results - page 216 / 1064
» Which Search Problems Are Random
Sort
View
MVA
1990
123views Computer Vision» more  MVA 1990»
15 years 5 months ago
Randomized Hough Transform (RHT) in Engineering Drawing Vectorization System
Abstract When the data is processed from the digitized drawThis paper presents how the recently presented Randomized IIough Transform (RHT) method can be used as a part of an engin...
Pekka Kultanen, Erkki Oja, Lei Xu
LPNMR
2007
Springer
15 years 10 months ago
On the Effectiveness of Looking Ahead in Search for Answer Sets
Abstract. Most complete answer set solvers are based on DPLL. One of the constraint propagation methods is the so-called lookahead, which has been somewhat controversial, due to it...
Guohua Liu, Jia-Huai You
103
Voted
ESA
2009
Springer
104views Algorithms» more  ESA 2009»
15 years 10 months ago
Improved Approximation Algorithms for Label Cover Problems
In this paper we consider both the maximization variant Max Rep and the minimization variant Min Rep of the famous Label Cover problem, for which, till now, the best approximation ...
Moses Charikar, MohammadTaghi Hajiaghayi, Howard J...
CRYPTO
1999
Springer
109views Cryptology» more  CRYPTO 1999»
15 years 8 months ago
Coding Constructions for Blacklisting Problems without Computational Assumptions
Abstract. We consider the broadcast exclusion problem: how to transmit a message over a broadcast channel shared by N = 2n users so that all but some specified coalition of k excl...
Ravi Kumar, Sridhar Rajagopalan, Amit Sahai
UAI
2003
15 years 5 months ago
Monte-Carlo optimizations for resource allocation problems in stochastic network systems
Real-world distributed systems and networks are often unreliable and subject to random failures of its components. Such a stochastic behavior affects adversely the complexity of o...
Milos Hauskrecht, Tomás Singliar