Sciweavers

385 search results - page 38 / 77
» A Fast Algorithm for Matrix Balancing
Sort
View
ECML
2006
Springer
14 years 4 days ago
B-Matching for Spectral Clustering
We propose preprocessing spectral clustering with b-matching to remove spurious edges in the adjacency graph prior to clustering. B-matching is a generalization of traditional maxi...
Tony Jebara, Vlad Shchogolev
IWPEC
2004
Springer
14 years 3 months ago
Perfect Path Phylogeny Haplotyping with Missing Data Is Fixed-Parameter Tractable
Abstract. Haplotyping via perfect phylogeny is a method for retrieving haplotypes from genotypes. Fast algorithms are known for computing perfect phylogenies from complete and erro...
Jens Gramm, Till Nierhoff, Till Tantau
TSP
2010
13 years 4 months ago
Power allocation for a MIMO relay system with multiple-antenna users
A power allocation or scheduling problem is studied for a multiuser multiple-input multiple-output (MIMO) wireless relay system where there is a non-regenerative relay between one ...
Yuan Yu, Yingbo Hua
EUROGRAPHICS
2010
Eurographics
14 years 7 months ago
Fitted BVH for Fast Raytracing of Metaballs
Raytracing metaballs is a problem that has numerous applications in the rendering of dynamic soft objects such as fluids. However, current techniques are either limited in the vi...
Olivier Gourmel, Anthony Pajot, Mathias Paulin, Lo...
GECCO
2003
Springer
153views Optimization» more  GECCO 2003»
14 years 3 months ago
SEPA: Structure Evolution and Parameter Adaptation in Feed-Forward Neural Networks
Abstract. In developing algorithms that dynamically changes the structure and weights of ANN (Artificial Neural Networks), there must be a proper balance between network complexit...
Paulito P. Palmes, Taichi Hayasaka, Shiro Usui