Sciweavers

575 search results - page 18 / 115
» What is the space for
Sort
View
STOC
2003
ACM
178views Algorithms» more  STOC 2003»
14 years 10 months ago
Uniform hashing in constant time and linear space
Many algorithms and data structures employing hashing have been analyzed under the uniform hashing assumption, i.e., the assumption that hash functions behave like truly random fu...
Anna Östlin, Rasmus Pagh
ISIPTA
2003
IEEE
14 years 3 months ago
Geometry of Upper Probabilities
In this paper we adopt the geometric approach to the theory of evidence to study the geometric counterparts of the plausibility functions, or upper probabilities. The computation ...
Fabio Cuzzolin
ECCC
2007
99views more  ECCC 2007»
13 years 9 months ago
An Exponential Time/Space Speedup For Resolution
Satisfiability algorithms have become one of the most practical and successful approaches for solving a variety of real-world problems, including hardware verification, experime...
Philipp Hertel, Toniann Pitassi
SSPR
2010
Springer
13 years 8 months ago
An Empirical Comparison of Kernel-Based and Dissimilarity-Based Feature Spaces
The aim of this paper is to find an answer to the question: What is the difference between dissimilarity-based classifications(DBCs) and other kernelbased classifications(KBCs)?...
Sang-Woon Kim, Robert P. W. Duin
CLA
2007
13 years 11 months ago
A New Concise Representation of Frequent Patterns through Disjunctive Search Space
The interest in a further pruning of the set of frequent patterns that can be drawn from real-life datasets is growing up. In fact, it is a quite survival reflex towards providing...
Tarek Hamrouni, Islem Denden, Sadok Ben Yahia, Eng...