Sciweavers

2479 search results - page 136 / 496
» Quantum complexity theory
Sort
View
PODS
2008
ACM
141views Database» more  PODS 2008»
16 years 7 months ago
On the complexity of deriving schema mappings from database instances
We introduce a theoretical framework for discovering relationships between two database instances over distinct and unknown schemata. This framework is grounded in the context of ...
Pierre Senellart, Georg Gottlob
DCC
2005
IEEE
16 years 6 months ago
Efficient Alphabet Partitioning Algorithms for Low-Complexity Entropy Coding
We analyze the technique for reducing the complexity of entropy coding consisting in the a priori grouping of the source alphabet symbols, and in dividing the coding process in tw...
Amir Said
TIT
2010
107views Education» more  TIT 2010»
15 years 1 months ago
Rate distortion and denoising of individual data using Kolmogorov complexity
We examine the structure of families of distortion balls from the perspective of Kolmogorov complexity. Special attention is paid to the canonical rate-distortion function of a so...
Nikolai K. Vereshchagin, Paul M. B. Vitányi
CHI
2005
ACM
16 years 7 months ago
Shared landmarks in complex coordination environments
We explore the concept of social landmarks in complex, shared information and coordination environments. Previous research in navigation and shared spaces has tended to emphasize ...
Michael J. Muller, Olga Kuchinskaya, Suzanne O. Mi...
PODS
2007
ACM
196views Database» more  PODS 2007»
16 years 7 months ago
On the complexity of managing probabilistic XML data
In [3], we introduced a framework for querying and updating probabilistic information over unordered labeled trees, the probabilistic tree model. The data model is based on trees ...
Pierre Senellart, Serge Abiteboul