Sciweavers

1172 search results - page 106 / 235
» Constructions of generalized Sidon sets
Sort
View
MFCS
1997
Springer
15 years 10 months ago
Resolution Proofs, Exponential Bounds, and Kolmogorov Complexity
We prove an exponential lower bound for the length of any resolution proof for the same set of clauses as the one used by Urquhart [13]. Our contribution is a significant simpli...
Uwe Schöning
CATA
2003
15 years 7 months ago
Implementation and Performance Evaluation of Intel VTUNE Image Processing Functions in the MATLAB Environment
Many current general purpose processors use extensions to the instruction set architecture to enhance the performance of digital image processing and multimedia applications. In t...
Phaisit Chewputtanagul, David Jeff Jackson, Kennet...
SODA
2004
ACM
137views Algorithms» more  SODA 2004»
15 years 7 months ago
The Bloomier filter: an efficient data structure for static support lookup tables
We introduce the Bloomier filter, a data structure for compactly encoding a function with static support in order to support approximate evaluation queries. Our construction gener...
Bernard Chazelle, Joe Kilian, Ronitt Rubinfeld, Ay...
AI
2000
Springer
15 years 6 months ago
Boolean connection algebras: A new approach to the Region-Connection Calculus
The Region-Connection Calculus (RCC) is a well established formal system for qualitative spatial reasoning. It provides an axiomatization of space which takes regions as primitive...
John G. Stell
SIGSOFT
2008
ACM
16 years 7 months ago
Requirements engineering: from craft to discipline
Getting the right software requirements under the right environment assumptions is a critical precondition for developing the right software. This task is intrinsically difficult....
Axel van Lamsweerde