Sciweavers

4526 search results - page 107 / 906
» Algorithmic problems related to the Internet
Sort
View
120
Voted
EDBT
2008
ACM
162views Database» more  EDBT 2008»
16 years 4 months ago
Schema merging and mapping creation for relational sources
We address the problem of generating a mediated schema from a set of relational data source schemas and conjunctive queries that specify where those schemas overlap. Unlike past a...
Rachel Pottinger, Philip A. Bernstein
LOGCOM
2010
120views more  LOGCOM 2010»
14 years 10 months ago
Paraconsistent Machines and their Relation to Quantum Computing
We describe a method to axiomatize computations in deterministic Turing machines (TMs). When applied to computations in non-deterministic TMs, this method may produce contradictor...
Juan C. Agudelo, Walter Alexandre Carnielli
TSP
2010
14 years 10 months ago
Block-sparse signals: uncertainty relations and efficient recovery
We consider efficient methods for the recovery of block-sparse signals--i.e., sparse signals that have nonzero entries occurring in clusters--from an underdetermined system of line...
Yonina C. Eldar, Patrick Kuppinger, Helmut Bö...
CONSTRAINTS
1999
105views more  CONSTRAINTS 1999»
15 years 3 months ago
Algorithmic Power from Declarative Use of Redundant Constraints
Interval constraints can be used to solve problems in numerical analysis. In this paper we show that one can improve the performance of such an interval constraint program by the ...
Maarten H. van Emden
CCCG
2010
15 years 5 months ago
Constrained k-center and movement to independence
We obtain hardness results and approximation algorithms for two related geometric problems involving movement. The first is a constrained variant of the k-center problem, arising ...
Adrian Dumitrescu, Minghui Jiang