Sciweavers

10608 search results - page 205 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
PODS
2008
ACM
141views Database» more  PODS 2008»
14 years 11 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
ALT
2002
Springer
14 years 7 months ago
The Complexity of Learning Concept Classes with Polynomial General Dimension
The general dimension is a combinatorial measure that characterizes the number of queries needed to learn a concept class. We use this notion to show that any p-evaluatable concep...
Johannes Köbler, Wolfgang Lindner
SIGIR
2006
ACM
14 years 4 months ago
Answering complex questions with random walk models
We present a novel framework for answering complex questions that relies on question decomposition. Complex questions are decomposed by a procedure that operates on a Markov chain...
Sanda M. Harabagiu, V. Finley Lacatusu, Andrew Hic...
COCO
2004
Springer
118views Algorithms» more  COCO 2004»
14 years 4 months ago
Towards the Classical Communication Complexity of Entanglement Distillation Protocols with Incomplete Information
Entanglement is an essential resource for quantum communication and quantum computation, similar to shared random bits in the classical world. Entanglement distillation extracts n...
Andris Ambainis, Ke Yang
GIS
1995
ACM
14 years 2 months ago
Measuring the Complexity of Polygonal Objects
Polygonal objects are characterized by the following well-known parameters: number of vertices, area, perimeter and so on. These parameters describe the data sets that are used in...
Thomas Brinkhoff, Hans-Peter Kriegel, Ralf Schneid...