Sciweavers

256 search results - page 41 / 52
» On a Generalized Notion of Mistake Bounds
Sort
View
EUROCRYPT
2007
Springer
14 years 1 months ago
Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility
We study conditional computational entropy: the amount of randomness a distribution appears to have to a computationally bounded observer who is given some correlated information....
Chun-Yuan Hsiao, Chi-Jen Lu, Leonid Reyzin
TPHOL
2005
IEEE
14 years 1 months ago
Alpha-Structural Recursion and Induction
The nominal approach to abstract syntax deals with the issues of bound names and α-equivalence by considering constructions and properties that are invariant with respect to permu...
Andrew M. Pitts
PODC
2005
ACM
14 years 1 months ago
Distance estimation and object location via rings of neighbors
We consider four problems on distance estimation and object location which share the common flavor of capturing global information via informative node labels: low-stretch routin...
Aleksandrs Slivkins
CIKM
2004
Springer
14 years 28 days ago
Indexing text data under space constraints
An important class of queries is the LIKE predicate in SQL. In the absence of an index, LIKE queries are subject to performance degradation. The notion of indexing on substrings (...
Bijit Hore, Hakan Hacigümüs, Balakrishna...
SWAT
2004
Springer
98views Algorithms» more  SWAT 2004»
14 years 27 days ago
Tight Approximability Results for Test Set Problems in Bioinformatics
In this paper, we investigate the test set problem and its variations that appear in a variety of applications. In general, we are given a universe of objects to be “distinguish...
Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao