1381 search results - page 72 / 277 » Computational Complexity of Constraint Satisfaction |
154
click to vote
IANDC
2007
15 years 4 months ago
2007
The edit distance (or Levenshtein distance) between two words is the smallest number of substitutions, insertions, and deletions of symbols that can be used to transform one of the...
139
click to vote
ICPP
2005
IEEE
15 years 9 months ago
2005
IEEE
In recent years integrating multiprocessors in a single chip is emerging for supporting various scientific and commercial applications, with diverse demands to the underlying on-c...
140
click to vote
ICIP
2008
IEEE
16 years 5 months ago
2008
IEEE
The allowable computational complexity of video encoding is limited in a power-constrained system. Different video frames are associated with different motions and contexts, and s...
145
click to vote
IAT
2006
IEEE
15 years 10 months ago
2006
IEEE
In this paper, we propose a novel approach to solving the distributed constraint optimisation problem (DCOP) that guarantees completeness, while having linear communication comple...
135
click to vote
CAD
2000
Springer
15 years 3 months ago
2000
Springer
Very large and geometrically complex scenes, exceeding millions of polygons and hundreds of objects, arise naturally in many areas of interactive computer graphics. Time-critical ...