Sciweavers

644 search results - page 74 / 129
» Decomposition Complexity
Sort
View
106
Voted
CASSIS
2005
Springer
15 years 6 months ago
Modular Proof Principles for Parameterised Concretizations
Abstract. Abstract interpretation is a particularly well-suited methodology to build modular correctness proof of static analysers. Proof modularity becomes essential when correctn...
David Pichardie
113
Voted
CSCLP
2005
Springer
15 years 6 months ago
Complete Propagation Rules for Lexicographic Order Constraints over Arbitrary Domains
We give an efficiently executable specification of the global constraint of lexicographic order in the Constraint Handling Rules (CHR) language. In contrast to previous approaches...
Thom W. Frühwirth
95
Voted
IBPRIA
2005
Springer
15 years 6 months ago
A Real-Time Gabor Primal Sketch for Visual Attention
We describe a fast algorithm for Gabor filtering, specially designed for multi-scale image representations. Our proposal is based on three facts: first, Gabor functions can be de...
Alexandre Bernardino, José Santos-Victor
VLDB
2005
ACM
86views Database» more  VLDB 2005»
15 years 6 months ago
One-Pass Wavelet Synopses for Maximum-Error Metrics
We study the problem of computing waveletbased synopses for massive data sets in static and streaming environments. A compact representation of a data set is obtained after a thre...
Panagiotis Karras, Nikos Mamoulis
102
Voted
CSCLP
2005
Springer
15 years 6 months ago
Among, Common and Disjoint Constraints
Abstract. Among, Common and Disjoint are global constraints useful in modelling problems involving resources. We study a number of variations of these constraints over integer and ...
Christian Bessière, Emmanuel Hebrard, Brahi...