Sciweavers

3136 search results - page 240 / 628
» Comparison of Clique-Listing Algorithms
Sort
View
DISOPT
2008
88views more  DISOPT 2008»
15 years 6 months ago
New updating criteria for conflict-based branching heuristics in DPLL algorithms for satisfiability
The paper is concerned with the computational evaluation and comparison of a new family of conflict-based branching heuristics for evolved DPLL Satisfiability solvers. Such a fami...
Renato Bruni, Andrea Santori
CCCG
2009
15 years 7 months ago
Slope Preserving Terrain Simplification - An Experimental Study
This paper introduces a new measure of quality for terrain surface simplification aiming at preserving the slope of the surface, as well as a new simplification algorithm which sa...
Ahmad Biniaz
FECS
2006
113views Education» more  FECS 2006»
15 years 8 months ago
A Lightweight Program Similarity Detection Model using XML and Levenshtein Distance
Program plagiarism is one of the most significant problems in Computer Science education. Most common plagiarism includes modifying comments, reordering statements, and changing v...
Seo-Young Noh, Sangwoo Kim, Cheonyoung Jung
DCC
2008
IEEE
16 years 6 months ago
Compression of Hyperspectral Images with LVQ-SPECK
We discuss the use of lattice vector quantizers in conjunction with a quadtree-based sorting algorithm for the compression of multidimensional data sets, as encountered, for examp...
Alessandro J. S. Dutra, William A. Pearlman, Eduar...
SISAP
2009
IEEE
149views Data Mining» more  SISAP 2009»
16 years 1 months ago
Combinatorial Framework for Similarity Search
—We present an overview of the combinatorial framework for similarity search. An algorithm is combinatorial if only direct comparisons between two pairwise similarity values are ...
Yury Lifshits