Sciweavers

7167 search results - page 549 / 1434
» Answer Set Programming
Sort
View
STOC
2009
ACM
120views Algorithms» more  STOC 2009»
16 years 5 months ago
Bit-probe lower bounds for succinct data structures
We prove lower bounds on the redundancy necessary to represent a set S of objects using a number of bits close to the information-theoretic minimum log2 |S|, while answering vario...
Emanuele Viola
TCC
2009
Springer
132views Cryptology» more  TCC 2009»
16 years 5 months ago
Authenticated Adversarial Routing
: The aim of this paper is to demonstrate the feasibility of authenticated throughput-ecient routing in an unreliable and dynamically changing synchronous network in which the majo...
Yair Amir, Paul Bunn, Rafail Ostrovsky
ICDT
2010
ACM
211views Database» more  ICDT 2010»
16 years 2 months ago
Probabilistic Data Exchange
The work reported here lays the foundations of data exchange in the presence of probabilistic data. This requires rethinking the very basic concepts of traditional data exchange, ...
Ronald Fagin, Benny Kimelfeld, Phokion Kolaitis
COCOON
2009
Springer
15 years 11 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
2010
ACM
172views Database» more  EDBT 2010»
15 years 10 months ago
Privacy preserving group nearest neighbor queries
User privacy in location-based services has attracted great interest in the research community. We introduce a novel framework based on a decentralized architecture for privacy pr...
Tanzima Hashem, Lars Kulik, Rui Zhang