Sciweavers

109 search results - page 8 / 22
» Computing the betti numbers of arrangements
Sort
View
SODA
2010
ACM
164views Algorithms» more  SODA 2010»
15 years 4 months ago
Hardness Results for Homology Localization
: © Hardness Results for Homology Localization Chao Chen, Daniel Freedman HP Laboratories HPL-2009-374 algebraic topology, homology, localization We address the problem of localiz...
Chao Chen, Daniel Freedman
CHI
2010
ACM
16 years 27 days ago
Graphemes: self-organizing shape-based clustered structures for network visualisations
Network visualisations use clustering approaches to simplify the presentation of complex graph structures. We present a novel application of clustering algorithms, which controls ...
Ross Shannon, Aaron J. Quigley, Paddy Nixon
IJCNN
2006
IEEE
16 years 2 days ago
A Very Small Chaotic Neural Net
— Previously we have shown that chaos can arise in networks of physically realistic neurons [1], [2]. Those networks contain a moderate to large number of units connected in a sp...
Carlos Lourenco
IJHPCA
2006
109views more  IJHPCA 2006»
15 years 6 months ago
A Resource Leasing Policy for on-Demand Computing
Leasing computational resources for on-demand computing is now a viable option for providers of network services. Temporary spikes or lulls in demand for a service can be accommod...
Darin England, Jon B. Weissman
IPPS
2009
IEEE
16 years 20 days ago
Parallel solvers for dense linear systems for heterogeneous computational clusters
This paper describes the design and the implementation of parallel routines in the Heterogeneous ScaLAPACK library that solve a dense system of linear equations. This library is w...
Ravi Reddy Manumachu, Alexey L. Lastovetsky, Pedro...