1920 search results - page 166 / 384 » The Range Constraint: Algorithms and Implementation |
133
click to vote
ICPR
2000
IEEE
16 years 5 months ago
2000
IEEE
Motion estimation in image sequences is an important step in many computer vision and image processing applications. Several methods for solving this problem have been proposed, b...
134
click to vote
CEC
2007
IEEE
15 years 8 months ago
2007
IEEE
Routing in computer networks is a nonlinear combinatorial optimization problem with numerous constraints and is classified as an NP-complete problem. There are certain important Qo...
118
click to vote
GD
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. A graph is planar if and only if it does not contain a Kuratowski subdivision. Hence such a subdivision can be used as a witness for non-planarity. Modern planarity testi...
189
click to vote
KONVENS
2000
15 years 7 months ago
2000
In this paper we describe a noise reduction preprocessing algorithm for the adaptive multirate (AMR) speech codec of the GSM system. The algorithm is based on spectral weighting a...
122
click to vote
AAAI
1997
15 years 5 months ago
1997
We report on the performance of an enhanced version of the “Davis-Putnam” (DP) proof procedure for propositional satisfiability (SAT) on large instances derived from realworld...