Sciweavers

1888 search results - page 120 / 378
» Algorithms for Querying by Spatial Structure
Sort
View
SWAT
1994
Springer
117views Algorithms» more  SWAT 1994»
15 years 8 months ago
Lower Bounds for Dynamic Algorithms
We study the complexity of the dynamic partial sum problem in the cell-probe model. We give the model access to nondeterministic queries and prove that the problem remains hard. We...
Michael L. Fredman
SIGMOD
2007
ACM
111views Database» more  SIGMOD 2007»
16 years 4 months ago
Query relaxation using malleable schemas
In contrast to classical databases and IR systems, real-world information systems have to deal increasingly with very vague and diverse structures for information management and s...
Xuan Zhou, Julien Gaugaz, Wolf-Tilo Balke, Wolfgan...
SAC
2009
ACM
15 years 11 months ago
Building an efficient preference XML query processor
Today user-centered information acquisition over collections of complex XML documents is increasingly in demand. To this end, preferences have become an important paradigm enablin...
SungRan Cho, Wolf-Tilo Balke
128
Voted
GECCO
2007
Springer
154views Optimization» more  GECCO 2007»
15 years 11 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...
BIBE
2007
IEEE
152views Bioinformatics» more  BIBE 2007»
15 years 4 months ago
SBLAST: Structural Basic Local Alignment Searching Tools using Geometric Hashing
While much research has been done on finding similarities between protein sequences, there has not been the same progress on finding similarities between protein structures. Here ...
Tom Milledge, Gaolin Zheng, Tim Mullins, Giri Nara...