Sciweavers

4536 search results - page 125 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
BMCBI
2011
13 years 23 days ago
Clustering gene expression data with a penalized graph-based metric
Background: The search for cluster structure in microarray datasets is a base problem for the so-called “-omic sciences”. A difficult problem in clustering is how to handle da...
Ariel E. Bayá, Pablo M. Granitto
SIAMCOMP
1998
85views more  SIAMCOMP 1998»
13 years 8 months ago
Separator-Based Sparsification II: Edge and Vertex Connectivity
We consider the problem of maintaining a dynamic planar graph subject to edge insertions and edge deletions that preserve planarity but that can change the embedding. We describe a...
David Eppstein, Zvi Galil, Giuseppe F. Italiano, T...
TNN
2010
233views Management» more  TNN 2010»
13 years 3 months ago
A hierarchical RBF online learning algorithm for real-time 3-D scanner
In this paper, a novel real-time online network model is presented. It is derived from the hierarchical radial basis function (HRBF) model and it grows by automatically adding unit...
Stefano Ferrari, Francesco Bellocchio, Vincenzo Pi...
ESA
1998
Springer
162views Algorithms» more  ESA 1998»
14 years 23 days ago
External Memory Algorithms
Abstract. Data sets in large applications are often too massive to t completely inside the computer's internal memory. The resulting input output communication or I O between ...
Jeffrey Scott Vitter
CORR
2011
Springer
144views Education» more  CORR 2011»
13 years 29 days ago
Rank Aggregation via Nuclear Norm Minimization
The process of rank aggregation is intimately intertwined with the structure of skew-symmetric matrices. We apply recent advances in the theory and algorithms of matrix completion...
David F. Gleich, Lek-Heng Lim