Sciweavers

285 search results - page 7 / 57
» A New Heuristic for Optimizing Large Queries
Sort
View
CSB
2004
IEEE
109views Bioinformatics» more  CSB 2004»
13 years 11 months ago
Rec-I-DCM3: A Fast Algorithmic Technique for Reconstructing Large Phylogenetic Trees
Phylogenetic trees are commonly reconstructed based on hard optimization problems such as maximum parsimony (MP) and maximum likelihood (ML). Conventional MP heuristics for produc...
Usman Roshan, Bernard M. E. Moret, Tandy Warnow, T...
PVLDB
2010
89views more  PVLDB 2010»
13 years 5 months ago
Transforming Range Queries To Equivalent Box Queries To Optimize Page Access
Range queries based on L1 distance are a common type of queries in multimedia databases containing feature vectors. We propose a novel approach that transforms the feature space i...
Sakti Pramanik, Alok Watve, Chad R. Meiners, Alex ...
CCE
2004
13 years 7 months ago
Dynamic programming in a heuristically confined state space: a stochastic resource-constrained project scheduling application
The Resource-Constrained Project Scheduling Problem(RCPSP) is a significant challenge in highly regulated industries, such as pharmaceuticals and agrochemicals, where a large numb...
Jaein Choi, Matthew J. Realff, Jay H. Lee
ICDE
2010
IEEE
491views Database» more  ICDE 2010»
14 years 7 months ago
TrajStore: An Adaptive Storage System for Very Large Trajectory Data Sets
The rise of GPS and broadband-speed wireless devices has led to tremendous excitement about a range of applications broadly characterized as "location based services". Cu...
Philippe Cudré-Mauroux, Eugene Wu, Samuel M...
SIGMOD
2001
ACM
147views Database» more  SIGMOD 2001»
14 years 7 months ago
Optimizing Queries Using Materialized Views: A practical, scalable solution
Materialized views can provide massive improvements in query processing time, especially for aggregation queries over large tables. To realize this potential, the query optimizer ...
Jonathan Goldstein, Per-Åke Larson