Sciweavers

Share
BMCBI
2005
122views more  BMCBI 2005»
9 years 6 months ago
FACT - a framework for the functional interpretation of high-throughput experiments
Background: Interpreting the results of high-throughput experiments, such as those obtained from DNA-microarrays, is an often time-consuming task due to the high number of data-po...
Felix Kokocinski, Nicolas Delhomme, Gunnar Wrobel,...
SMA
2008
ACM
155views Solid Modeling» more  SMA 2008»
9 years 6 months ago
Filament tracking and encoding for complex biological networks
We present a framework for segmenting and storing filament networks from scalar volume data. Filament structures are commonly found in data generated using high-throughput microsc...
David Mayerich, John Keyser
ML
2006
ACM
9 years 6 months ago
A Unified View on Clustering Binary Data
Clustering is the problem of identifying the distribution of patterns and intrinsic correlations in large data sets by partitioning the data points into similarity classes. This p...
Tao Li
IJBRA
2006
92views more  IJBRA 2006»
9 years 6 months ago
Jumpstarting phylogenetic analysis
: Phylogenetic analysis is a central tool in studies of comparative genomics. When a new region of DNA is isolated and sequenced, researchers are often forced to throw away months ...
Jesse Mecham, Mark J. Clement, Quinn Snell, Todd F...
IJON
2008
173views more  IJON 2008»
9 years 6 months ago
Support vector machine classification for large data sets via minimum enclosing ball clustering
Support vector machine (SVM) is a powerful technique for data classification. Despite of its good theoretic foundations and high classification accuracy, normal SVM is not suitabl...
Jair Cervantes, Xiaoou Li, Wen Yu, Kang Li
GRID
2006
Springer
9 years 6 months ago
Simultaneous Scheduling of Replication and Computation for Data-Intensive Applications on the Grid
One of the first motivations of using grids comes from applications managing large data sets in field such as high energy physics or life sciences. To improve the global throughput...
Frederic Desprez, Antoine Vernois
BMCBI
2010
139views more  BMCBI 2010»
9 years 7 months ago
A highly efficient multi-core algorithm for clustering extremely large datasets
Background: In recent years, the demand for computational power in computational biology has increased due to rapidly growing data sets from microarray and other high-throughput t...
Johann M. Kraus, Hans A. Kestler
NIPS
2000
9 years 8 months ago
Sparse Representation for Gaussian Process Models
We develop an approach for a sparse representation for Gaussian Process (GP) models in order to overcome the limitations of GPs caused by large data sets. The method is based on a...
Lehel Csató, Manfred Opper
DAGSTUHL
1997
9 years 8 months ago
InVIS - Interactive Visualization of Medical Data Sets
Interactive rendering of large data sets requires fast algorithms and rapid hardware acceleration. Both can be improved, but none of this ensures interactive response times. If a ...
Jörg Meyer, Steffen Gelder, Timna E. Schneide...
ALENEX
2003
144views Algorithms» more  ALENEX 2003»
9 years 8 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
books