Sciweavers

231 search results - page 29 / 47
» Sublinear time approximate clustering
Sort
View
WSC
1997
15 years 1 months ago
Time-Parallel Generation of Self-Similar ATM Traffic
We present a time–parallel technique for the fast generation of self–similar traffic which is suitable for performance studies of Asynchronous Transfer Mode (ATM) networks. Th...
Ioanis Nikolaidis, C. Anthony Cooper, Kalyan S. Pe...
92
Voted
AMDO
2006
Springer
15 years 4 months ago
Finding Articulated Body in Time-Series Volume Data
This paper presents a new scheme for acquiring 3D kinematic structure and motion from time-series volume data, in particular, focusing on human body. Our basic strategy is to first...
Tomoyuki Mukasa, Shohei Nobuhara, Atsuto Maki, Tak...
OSDI
2008
ACM
16 years 23 days ago
Improving MapReduce Performance in Heterogeneous Environments
MapReduce is emerging as an important programming model for large-scale data-parallel applications such as web indexing, data mining, and scientific simulation. Hadoop is an open-...
Matei Zaharia, Andy Konwinski, Anthony D. Joseph, ...
100
Voted
BMCBI
2006
117views more  BMCBI 2006»
15 years 15 days ago
The Cluster Variation Method for Efficient Linkage Analysis on Extended Pedigrees
Background: Computing exact multipoint LOD scores for extended pedigrees rapidly becomes infeasible as the number of markers and untyped individuals increase. When markers are exc...
Cornelis A. Albers, Martijn A. R. Leisink, Hilbert...
94
Voted
CSB
2005
IEEE
139views Bioinformatics» more  CSB 2005»
15 years 6 months ago
Using Parallel Algorithms for Searching Molecular Sequence Databases
This work presents the development of algorithms for approximate string matching using parallel methods. It intends to do the maximum of molecular sequences comparisons per unity ...
Carla Correa Tavares dos Reis, Rubem P. Mondaini