Sciweavers

5372 search results - page 800 / 1075
» complexity 2007
Sort
View
CSR
2007
Springer
16 years 25 days ago
Ruling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction Problems
The maximum constraint satisfaction problem (Max CSP) is the following computational problem: an instance is a finite collection of constraints on a set of variables, and the goal...
Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen
CSR
2007
Springer
16 years 25 days ago
Marrying Words and Trees
Traditionally, data that has both linear and hierarchical structure, such as annotated linguistic data, is modeled using ordered trees and queried using tree automata. In this pap...
Rajeev Alur
DAWAK
2007
Springer
16 years 25 days ago
Automating the Schema Matching Process for Heterogeneous Data Warehouses
Abstract. A federated data warehouse is a logical integration of data warehouses applicable when physical integration is impossible due to privacy policy or legal restrictions. In ...
Marko Banek, Boris Vrdoljak, A. Min Tjoa, Zoran Sk...
DCOSS
2007
Springer
16 years 25 days ago
Design and Implementation of a Flexible Location Directory Service for Tiered Sensor Networks
Many emergent distributed sensing applications need to keep track of mobile entities across multiple sensor networks connected via an IP network. To simplify the realization of suc...
Sangeeta Bhattacharya, Chien-Liang Fok, Chenyang L...
DEXA
2007
Springer
150views Database» more  DEXA 2007»
16 years 25 days ago
Sequence Alignment as a Database Technology Challenge
Abstract. Sequence alignment is an important task for molecular biologists. Because alignment basically deals with approximate string matching on large biological sequence collecti...
Hans Philippi