Sciweavers

2124 search results - page 304 / 425
» Repairing Structurally Complex Data
Sort
View
STOC
2003
ACM
193views Algorithms» more  STOC 2003»
14 years 9 months ago
Space efficient dynamic stabbing with fast queries
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
Mikkel Thorup
EDBT
2008
ACM
120views Database» more  EDBT 2008»
14 years 9 months ago
Schema mapping verification: the spicy way
Schema mapping algorithms rely on value correspondences ? i.e., correspondences among semantically related attributes ? to produce complex transformations among data sources. Thes...
Angela Bonifati, Giansalvatore Mecca, Alessandro P...
MDM
2009
Springer
130views Communications» more  MDM 2009»
14 years 3 months ago
Towards an Indoor Level-of-Detail Model for Route Visualization
Indoor routing represents an essential feature required by applications and systems that provide spatial information about complex sites, buildings and infrastructures such as in ...
Benjamin Hagedorn, Matthias Trapp, Tassilo Glander...
GECCO
2007
Springer
154views Optimization» more  GECCO 2007»
14 years 3 months ago
A novel ab-initio genetic-based approach for protein folding prediction
In this paper, a model based on genetic algorithms for protein folding prediction is proposed. The most important features of the proposed approach are: i) Heuristic secondary str...
Sergio Raul Duarte Torres, David Camilo Becerra Ro...
ISAAC
2007
Springer
70views Algorithms» more  ISAAC 2007»
14 years 3 months ago
Kinetic Maintenance of Mobile k-Centres on Trees
Let C denote a set of n mobile clients, each of which follows a continuous trajectory on a weighted tree T. We establish tight bounds on the maximum relative velocity of the 1-cent...
Stephane Durocher, Christophe Paul