Sciweavers

1709 search results - page 106 / 342
» Comparing the Performance of Database Selection Algorithms
Sort
View
DASFAA
2010
IEEE
193views Database» more  DASFAA 2010»
15 years 3 months ago
A Simple, Yet Effective and Efficient, Sliding Window Sampling Algorithm
Sampling streams of continuous data with limited memory, or reservoir sampling, is a utility algorithm. Standard reservoir sampling maintains a random sample of the entire stream a...
Xuesong Lu, Wee Hyong Tok, Chedy Raïssi, St&e...
ICDE
2012
IEEE
227views Database» more  ICDE 2012»
13 years 7 months ago
Horizontal Reduction: Instance-Level Dimensionality Reduction for Similarity Search in Large Document Databases
—Dimensionality reduction is essential in text mining since the dimensionality of text documents could easily reach several tens of thousands. Most recent efforts on dimensionali...
Min-Soo Kim 0001, Kyu-Young Whang, Yang-Sae Moon
159
Voted
DEXAW
1999
IEEE
91views Database» more  DEXAW 1999»
15 years 9 months ago
Hierarchical Scheduling Algorithms for Near-Line Tape Libraries
Robotic tape libraries (RTLs) currently enjoy a prominent place in the storage market, with a reported average annual growth rate approaching 34%, primarily due to their low cost ...
Peter Triantafillou, Ioannis Georgiadis
ACIIDS
2012
IEEE
307views Database» more  ACIIDS 2012»
14 years 22 days ago
A Hybrid Evolutionary Imperialist Competitive Algorithm (HEICA)
This paper proposes a new approach by combining the Evolutionary Algorithm and Imperialist Competitive Algorithm. This approach tries to capture several people involved in communit...
Fatemeh Ramezani, Shahriar Lotfi, M. A. Soltani-Sa...
BMCBI
2011
14 years 8 months ago
Faster Smith-Waterman database searches with inter-sequence SIMD parallelisation
Background: The Smith-Waterman algorithm for local sequence alignment is more sensitive than heuristic methods for database searching, but also more time-consuming. The fastest ap...
Torbjørn Rognes