Sciweavers

197 search results - page 3 / 40
» On the Existence of Large Sets of t-designs of Prime Sizes
Sort
View
ALENEX
2003
144views Algorithms» more  ALENEX 2003»
13 years 7 months ago
Cache-Conscious Sorting of Large Sets of Strings with Dynamic Tries
Ongoing changes in computer performance are affecting the efficiency of string sorting algorithms. The size of main memory in typical computers continues to grow, but memory acce...
Ranjan Sinha, Justin Zobel
BMCBI
2010
151views more  BMCBI 2010»
13 years 5 months ago
TF-finder: A software package for identifying transcription factors involved in biological processes using microarray data and e
Background: Identification of transcription factors (TFs) involved in a biological process is the first step towards a better understanding of the underlying regulatory mechanisms...
Xiaoqi Cui, Tong Wang, Huann-Sheng Chen, Victor Bu...
PODS
2006
ACM
95views Database» more  PODS 2006»
14 years 5 months ago
Randomized computations on large data sets: tight lower bounds
We study the randomized version of a computation model (introduced in [9, 10]) that restricts random access to external memory and internal memory space. Essentially, this model c...
André Hernich, Martin Grohe, Nicole Schweik...
EVOW
2007
Springer
13 years 12 months ago
Reducing the Size of Traveling Salesman Problem Instances by Fixing Edges
Abstract. The Traveling Salesman Problem (TSP) is a well-known NPhard combinatorial optimization problem, for which a large variety of evolutionary algorithms are known. However, t...
Thomas Fischer, Peter Merz
DATAMINE
2006
127views more  DATAMINE 2006»
13 years 5 months ago
Computing LTS Regression for Large Data Sets
Least trimmed squares (LTS) regression is based on the subset of h cases (out of n) whose least squares t possesses the smallest sum of squared residuals. The coverage h may be se...
Peter Rousseeuw, Katrien van Driessen