Sciweavers

256 search results - page 49 / 52
» Approximation Algorithms for Hamming Clustering Problems
Sort
View
WWW
2010
ACM
15 years 4 months ago
Sampling community structure
We propose a novel method, based on concepts from expander graphs, to sample communities in networks. We show that our sampling method, unlike previous techniques, produces subgra...
Arun S. Maiya, Tanya Y. Berger-Wolf
ICMLA
2007
14 years 11 months ago
Scalable optimal linear representation for face and object recognition
Optimal Component Analysis (OCA) is a linear method for feature extraction and dimension reduction. It has been widely used in many applications such as face and object recognitio...
Yiming Wu, Xiuwen Liu, Washington Mio
ESANN
2004
14 years 11 months ago
Neural dynamics for task-oriented grouping of communicating agents
Abstract. Many real world problems are given in the form of multiple measurements comprising local descriptions or tasks. We propose that a dynamical organization of a population o...
Jochen J. Steil
EDBT
2008
ACM
122views Database» more  EDBT 2008»
15 years 9 months ago
Semantic peer, here are the neighbors you want!
Peer Data Management Systems (PDMSs) have been introduced as a solution to the problem of large-scale sharing of semantically rich data. A PDMS consists of semantic peers connecte...
Wilma Penzo, Stefano Lodi, Federica Mandreoli, Ric...
NIPS
2004
14 years 11 months ago
Hierarchical Eigensolver for Transition Matrices in Spectral Methods
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...
Chakra Chennubhotla, Allan D. Jepson