562 search results - page 75 / 113 » Simple Randomized Algorithms for Closest Pair Problems |
ECCC
2006
14 years 9 months ago
2006
Detecting the relevant attributes of an unknown target concept is an important and well studied problem in algorithmic learning. Simple greedy strategies have been proposed that s...
ICCV
2009
IEEE
16 years 2 months ago
2009
IEEE
Markov Random Field is now ubiquitous in many formulations
of various vision problems. Recently, optimization
of higher-order potentials became practical using higherorder
graph...
CIBCB
2007
IEEE
15 years 4 months ago
2007
IEEE
Abstract— Multiple sequence alignment is an important problem in computational biology. A-star is an algorithm that can be used to find exact alignments. We present a simple mod...
113
click to vote
CP
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Constraint satisfaction and propositional satisfiability problems are often solved using backtracking search. Previous studies have shown that a technique called randomi...
COCOON
2007
Springer
15 years 3 months ago
2007
Springer
We propose new algorithms and improved bounds for interference-aware routing in wireless networks. First, we prove that n arbitrarily matched source-destinations pairs with average...