Sciweavers

10493 search results - page 2017 / 2099
» Dynamic Word Problems
Sort
View
RECOMB
2001
Springer
14 years 8 months ago
A new approach to sequence comparison: normalized sequence alignment
The Smith-Waterman algorithm for local sequence alignment is one of the most important techniques in computational molecular biology. This ingenious dynamic programming approach w...
Abdullah N. Arslan, Ömer Egecioglu, Pavel A. ...
OSDI
2008
ACM
14 years 8 months ago
On the Impact of Disk Scrubbing on Energy Savings
The increasing use of computers for saving valuable data imposes stringent reliability constraints on storage systems. Reliability improvement via use of redundancy is a common pr...
Guanying Wang, Ali Raza Butt, Chris Gniady
VLDB
2007
ACM
115views Database» more  VLDB 2007»
14 years 8 months ago
Context-Aware Wrapping: Synchronized Data Extraction
The deep Web presents a pressing need for integrating large numbers of dynamically evolving data sources. To be more automatic yet accurate in building an integration system, we o...
Shui-Lung Chuang, Kevin Chen-Chuan Chang, ChengXia...
SIGMOD
2008
ACM
111views Database» more  SIGMOD 2008»
14 years 8 months ago
Discovering bucket orders from full rankings
Discovering a bucket order B from a collection of possibly noisy full rankings is a fundamental problem that relates to various applications involving rankings. Informally, a buck...
Jianlin Feng, Qiong Fang, Wilfred Ng
SIGMOD
2007
ACM
165views Database» more  SIGMOD 2007»
14 years 8 months ago
Sharing aggregate computation for distributed queries
An emerging challenge in modern distributed querying is to efficiently process multiple continuous aggregation queries simultaneously. Processing each query independently may be i...
Ryan Huebsch, Minos N. Garofalakis, Joseph M. Hell...
« Prev « First page 2017 / 2099 Last » Next »