Sciweavers

351 search results - page 21 / 71
» An exact method for graph coloring
Sort
View
ICDE
2008
IEEE
190views Database» more  ICDE 2008»
14 years 9 months ago
Efficient Query Processing in Large Traffic Networks
Abstract-- We present an original graph embedding to speedup distance-range and k-nearest neighbor queries on static and/or dynamic objects located on a (weighted) graph. Our metho...
Hans-Peter Kriegel, Matthias Renz, Peer Kröge...
ICIAP
2003
ACM
14 years 27 days ago
Color matching by using tuple matching
In this paper we present a new matching method called Tuple Matching (TM), which is an algorithm for matching of signatures. Since signatures can contain arbitrary features like c...
Dirk Balthasar
ICIP
2007
IEEE
14 years 9 months ago
Color Image Denoising via Sparse 3D Collaborative Filtering with Grouping Constraint in Luminance-Chrominance Space
We propose an effective color image denoising method that exploits ltering in highly sparse local 3D transform domain in each channel of a luminance-chrominance color space. For e...
Kostadin Dabov, Alessandro Foi, Vladimir Katkovnik...
CC
2006
Springer
124views System Software» more  CC 2006»
13 years 11 months ago
Hybrid Optimizations: Which Optimization Algorithm to Use?
We introduce a new class of compiler heuristics: hybrid optimizations. Hybrid optimizations choose dynamically at compile time which optimization algorithm to apply from a set of d...
John Cavazos, J. Eliot B. Moss, Michael F. P. O'Bo...
ICPR
2002
IEEE
14 years 8 months ago
A Windowed Weighted Approach for Approximate Cyclic String Matching
A method for measuring dissimilarities between cyclic strings is introduced. It computes a weighted mean between two (lower and upper) bounds of the exact cyclic edit distance, wh...
Ramón Alberto Mollineda, Enrique Vidal, Fra...