Sciweavers

9572 search results - page 1711 / 1915
» Cover Algorithms and Their Combination
Sort
View
VLDB
1997
ACM
126views Database» more  VLDB 1997»
15 years 8 months ago
Dynamic Memory Adjustment for External Mergesort
Sorting is a memory intensive operation whose performance is greatly affected by the amount of memory available as work space. When the input size is unknown or available memory s...
Weiye Zhang, Per-Åke Larson
251
Voted
BIBE
2004
IEEE
160views Bioinformatics» more  BIBE 2004»
15 years 8 months ago
A Time Series Analysis of Microarray Data
As the capture and analysis of single-time-point microarray expression data becomes routine, investigators are turning to time-series expression data to investigate complex gene r...
Selnur Erdal, Ozgur Ozturk, David L. Armbruster, H...
CIKM
2006
Springer
15 years 8 months ago
Knowing a web page by the company it keeps
Web page classification is important to many tasks in information retrieval and web mining. However, applying traditional textual classifiers on web data often produces unsatisfyi...
Xiaoguang Qi, Brian D. Davison
CPM
2006
Springer
112views Combinatorics» more  CPM 2006»
15 years 8 months ago
Local Alignment of RNA Sequences with Arbitrary Scoring Schemes
Abstract. Local similarity is an important tool in comparative analysis of biological sequences, and is therefore well studied. In particular, the Smith-Waterman technique and its ...
Rolf Backofen, Danny Hermelin, Gad M. Landau, Oren...
127
Voted
GECCO
2006
Springer
133views Optimization» more  GECCO 2006»
15 years 8 months ago
A general coarse-graining framework for studying simultaneous inter-population constraints induced by evolutionary operations
The use of genotypic populations is necessary for adaptation in Evolutionary Algorithms. We use a technique called form-invariant commutation to study the immediate effect of evol...
Keki M. Burjorjee, Jordan B. Pollack
« Prev « First page 1711 / 1915 Last » Next »