Sciweavers

932 search results - page 93 / 187
» Where in the Wikipedia Is That Answer
Sort
View
TCC
2009
Springer
130views Cryptology» more  TCC 2009»
14 years 9 months ago
How Efficient Can Memory Checking Be?
We consider the problem of memory checking, where a user wants to maintain a large database on a remote server but has only limited local storage. The user wants to use the small ...
Cynthia Dwork, Moni Naor, Guy N. Rothblum, Vinod V...
PODS
2009
ACM
130views Database» more  PODS 2009»
14 years 9 months ago
Secondary indexing in one dimension: beyond b-trees and bitmap indexes
Let be a finite, ordered alphabet, and consider a string x = x1x2 . . . xn n . A secondary index for x answers alphabet range queries of the form: Given a range [al, ar] , retu...
Rasmus Pagh, Srinivasa Rao Satti
TCC
2010
Springer
188views Cryptology» more  TCC 2010»
14 years 6 months ago
Almost Optimal Bounds for Direct Product Threshold Theorem
Abstract. We consider weakly-verifiable puzzles which are challengeresponse puzzles such that the responder may not be able to verify for itself whether it answered the challenge ...
Charanjit S. Jutla
COCOON
2009
Springer
14 years 3 months ago
On the Generalised Character Compatibility Problem for Non-branching Character Trees
In [3], the authors introduced the Generalised Character Compatibility Problem as a generalisation of the Perfect Phylogeny Problem for a set of species. This generalised problem t...
Ján Manuch, Murray Patterson, Arvind Gupta
EDBT
2009
ACM
156views Database» more  EDBT 2009»
14 years 1 months ago
Secondary bitmap indexes with vertical and horizontal partitioning
Traditional bitmap indexes are utilized as a special type of primary or clustered indexes where the queries are answered by performing fast logical operations supported by hardwar...
Guadalupe Canahuate, Tan Apaydin, Ahmet Sacan, Hak...