Sciweavers

149 search results - page 12 / 30
» Uniform hashing in constant time and linear space
Sort
View
ALT
2006
Springer
14 years 5 months ago
Learning Linearly Separable Languages
This paper presents a novel paradigm for learning languages that consists of mapping strings to an appropriate high-dimensional feature space and learning a separating hyperplane i...
Leonid Kontorovich, Corinna Cortes, Mehryar Mohri
CORR
2011
Springer
143views Education» more  CORR 2011»
13 years 11 days ago
Non-malleable extractors via character sums
In studying how to communicate over a public channel with an active adversary, Dodis and Wichs introduced the notion of a non-malleable extractor. A non-malleable extractor dramat...
Trevor D. Wooley, David Zuckerman
VISUALIZATION
2005
IEEE
14 years 2 months ago
Scale-Invariant Volume Rendering
As standard volume rendering is based on an integral in physical space (or “coordinate space”), it is inherently dependent on the scaling of this space. Although this dependen...
Martin Kraus
JSYML
2000
110views more  JSYML 2000»
13 years 8 months ago
Basic Logic: Reflection, Symmetry, Visibility
We introduce a sequent calculus B for a new logic, named basic logic. The aim of basic logic is to find a structure in the space of logics. Classical, intuitionistic, quantum and ...
Giovanni Sambin, Giulia Battilotti, Claudia Faggia...
STOC
2001
ACM
159views Algorithms» more  STOC 2001»
14 years 9 months ago
Optimal static range reporting in one dimension
We consider static one dimensional range searching problems. These problems are to build static data structures for an integer set S U, where U = {0, 1, . . . , 2w - 1}, which su...
Stephen Alstrup, Gerth Stølting Brodal, The...