Sciweavers

1224 search results - page 98 / 245
» Concept Search
Sort
View
AAAI
1990
13 years 11 months ago
Some Applications of Graph Bandwidth to Constraint Satisfaction Problems
Bandwidth is a fundamental concept in graph theory which has some surprising applications to a class of AI search problems. Graph bandwidth provides a link between the syntactic s...
Ramin Zabih
JAL
2008
97views more  JAL 2008»
13 years 10 months ago
Experimental studies of variable selection strategies based on constraint weights
An important class of heuristics for constraint satisfaction problems works by sampling information during search in order to inform subsequent decisions. One of these strategies, ...
Richard J. Wallace, Diarmuid Grimes
GI
2004
Springer
14 years 4 months ago
Outlier Detection by Rareness Assumption
: A concept for identification of candidates for outliers is presented, with a focus on nominal variables. The database concerned is searched for rules that are almost universally...
Tomas Hrycej, Jochen Hipp
EJC
2006
13 years 10 months ago
Hadamard ideals and Hadamard matrices with two circulant cores
We apply Computational Algebra methods to the construction of Hadamard matrices with two circulant cores, given by Fletcher, Gysin and Seberry. We introduce the concept of Hadamar...
Ilias S. Kotsireas, Christos Koukouvinos, Jennifer...
PCM
2004
Springer
106views Multimedia» more  PCM 2004»
14 years 4 months ago
Performance Improvement of Vector Quantization by Using Threshold
Abstract. Vector quantization (VQ) is an elementary technique for image compression. However, the complexity of searching the nearest codeword in a codebook is time-consuming. In t...
Hung-Yi Chang, Pi-Chung Wang, Rong-Chang Chen, Shu...