Sciweavers

1236 search results - page 73 / 248
» On the Hamkins approximation property
Sort
View
KDD
2009
ACM
188views Data Mining» more  KDD 2009»
16 years 1 months ago
Mining discrete patterns via binary matrix factorization
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...
Bao-Hong Shen, Shuiwang Ji, Jieping Ye
DAM
2010
112views more  DAM 2010»
15 years 26 days ago
New results on optimizing rooted triplets consistency
Abstract. A set of phylogenetic trees with overlapping leaf sets is consistent if it can be merged without conflicts into a supertree. In this paper, we study the polynomial-time a...
Jaroslaw Byrka, Sylvain Guillemot, Jesper Jansson
SSS
2009
Springer
15 years 7 months ago
Stability of Distributed Algorithms in the Face of Incessant Faults
Abstract. For large distributed systems built from inexpensive components, one expects to see incessant failures. This paper proposes two models for such faults and analyzes two we...
Robert E. Lee DeVille, Sayan Mitra
85
Voted
DATE
2004
IEEE
108views Hardware» more  DATE 2004»
15 years 4 months ago
Poor Man's TBR: A Simple Model Reduction Scheme
This paper presents a model reduction algorithm motivated by a connection between frequency domain projection methods and approximation of truncated balanced realizations. The met...
Joel R. Phillips, Luis Miguel Silveira
116
Voted
ESANN
1997
15 years 2 months ago
Kohonen maps versus vector quantization for data analysis
Besides their topological properties, Kohonen maps are often used for vector quantization only. These auto-organised networks are often compared to other standard and/or adaptive v...
Eric de Bodt, Michel Verleysen, Marie Cottrell