Sciweavers

476 search results - page 45 / 96
» Information Algebras
Sort
View
ECCC
2006
120views more  ECCC 2006»
13 years 10 months ago
New Locally Decodable Codes and Private Information Retrieval Schemes
A q query Locally Decodable Code (LDC) encodes an n-bit message x as an N-bit codeword C(x), such that one can probabilistically recover any bit xi of the message by querying only...
Sergey Yekhanin
ISCI
2008
108views more  ISCI 2008»
13 years 10 months ago
Modeling and manipulating the structure of hierarchical schemas for the web
The Semantic Web is the next step of the current Web where information will become more machine-understandable to support effective data discovery and integration. Hierarchical sc...
Theodore Dalamagas, Alexandra Meliou, Timos K. Sel...
EJC
2010
13 years 8 months ago
Exact solution of two classes of prudent polygons
Prudent walks are self-avoiding walks on a lattice which never step into the direction of an already occupied vertex. We study the closed version of these walks, called prudent po...
Uwe Schwerdtfeger
FOIKS
2006
Springer
14 years 1 months ago
Iterative Modification and Incremental Evaluation of Preference Queries
Abstract. We present here a formal foundation for an iterative and incremental approach to constructing and evaluating preference queries. Our main focus is on query modification: ...
Jan Chomicki
JACM
2006
146views more  JACM 2006»
13 years 10 months ago
Limits on the ability of quantum states to convey classical messages
We revisit the problem of conveying classical messages by transmitting quantum states, and derive new, optimal bounds on the number of quantum bits required for this task. Much of...
Ashwin Nayak, Julia Salzman