Sciweavers

229 search results - page 31 / 46
» A new approach to dynamic self-tuning of database buffers
Sort
View
ICDE
2007
IEEE
173views Database» more  ICDE 2007»
16 years 1 months ago
Annotating Structured Data of the Deep Web
An increasing number of databases have become Web accessible through HTML form-based search interfaces. The data units returned from the underlying database are usually encoded in...
Yiyao Lu, Hai He, Hongkun Zhao, Weiyi Meng, Clemen...
BMCBI
2002
108views more  BMCBI 2002»
14 years 11 months ago
A memory-efficient dynamic programming algorithm for optimal alignment of a sequence to an RNA secondary structure
Background: Covariance models (CMs) are probabilistic models of RNA secondary structure, analogous to profile hidden Markov models of linear sequence. The dynamic programming algo...
Sean R. Eddy
ICDE
1998
IEEE
163views Database» more  ICDE 1998»
16 years 1 months ago
Fast Nearest Neighbor Search in High-Dimensional Space
Similarity search in multimedia databases requires an efficient support of nearest-neighbor search on a large set of high-dimensional points as a basic operation for query process...
Stefan Berchtold, Bernhard Ertl, Daniel A. Keim, H...
WETICE
2005
IEEE
15 years 5 months ago
CAFE - Collaborative Agents for Filtering E-mails
CAFE (Collaborative Agents for Filtering E-mails) is a multi-agent system to collaboratively filter spam from users’ mail stream. CAFE associates a proxy agent with each user, a...
Lorenzo Lazzari, Marco Mari, Agostino Poggi
79
Voted
VLDB
1997
ACM
134views Database» more  VLDB 1997»
15 years 3 months ago
Spatial Joins Using R-trees: Breadth-First Traversal with Global Optimizations
R-tree based spatial join is useful because of both its superior performance and the wide spread implementation of R-trees. We present a new R-tree join method called BFRJ (Breadt...
Yun-Wu Huang, Ning Jing, Elke A. Rundensteiner