Sciweavers

875 search results - page 142 / 175
» Linear Manifold Clustering
Sort
View
COMPGEOM
2000
ACM
14 years 2 months ago
When crossings count - approximating the minimum spanning tree
We present an (1+ε)-approximation algorithm for computing the minimum-spanning tree of points in a planar arrangement of lines, where the metric is the number of crossings betwee...
Sariel Har-Peled, Piotr Indyk
IPPS
1999
IEEE
14 years 2 months ago
Scalable Parallelization of Harmonic Balance Simulation
Abstract. A new approach to parallelizing harmonic balance simulation is presented. The technique leverages circuit substructure to expose potential parallelism in the form of a di...
David L. Rhodes, Apostolos Gerasoulis
AAAI
2008
14 years 22 hour ago
Multi-View Local Learning
The idea of local learning, i.e., classifying a particular example based on its neighbors, has been successfully applied to many semi-supervised and clustering problems recently. ...
Dan Zhang, Fei Wang, Changshui Zhang, Tao Li
APPT
2005
Springer
13 years 11 months ago
Experiments on Asynchronous Partial Gauss-Seidel Method
This paper presents design and experimental results of a parallel linear equation solver by asynchronous partial Gauss-Seidel method. The basic idea of this method is derived from ...
Hiroshi Nishida, Hairong Kuang
ICMLA
2008
13 years 11 months ago
New Insights into Learning Algorithms and Datasets
We report on three distinct experiments that provide new valuable insights into learning algorithms and datasets. We first describe two effective meta-features that significantly ...
Jun Won Lee, Christophe G. Giraud-Carrier