Sciweavers

849 search results - page 24 / 170
» On the Complexity of the Whitehead Minimization Problem
Sort
View
STOC
2001
ACM
151views Algorithms» more  STOC 2001»
14 years 8 months ago
On the cell probe complexity of membership and perfect hashing
We study two fundamental static data structure problems, membership and perfect hashing, in Yao's cell probe model. The first space and bit probe optimal worst case upper bou...
Rasmus Pagh
KDD
2005
ACM
80views Data Mining» more  KDD 2005»
14 years 8 months ago
Wavelet synopsis for data streams: minimizing non-euclidean error
We consider the wavelet synopsis construction problem for data streams where given n numbers we wish to estimate the data by constructing a synopsis, whose size, say B is much sma...
Sudipto Guha, Boulos Harb
LPAR
2000
Springer
13 years 11 months ago
On the Complexity of Theory Curbing
In this paper, we determine the complexity of propositional theory curbing. Theory Curbing is a nonmonotonic technique of common sense reasoning that is based on model minimality b...
Thomas Eiter, Georg Gottlob
DLT
2009
13 years 5 months ago
Branching-Time Temporal Logics with Minimal Model Quantifiers
Abstract. Temporal logics are a well investigated formalism for the specification and verification of reactive systems. Using formal verification techniques, we can ensure the corr...
Fabio Mogavero, Aniello Murano
IJIT
2004
13 years 9 months ago
A Constructive Problem Solver Approach for Building Agriculture Disorder Treatment Task
Expert systems development is a complex and expensive process that needs to be applied in an organized manner. This paper presents an approach for building a generic treatment mode...
Abeer El-Korany, Ahmed A. Rafea