Sciweavers

9886 search results - page 1448 / 1978
» Learning Compressible Models
Sort
View
ICIAP
2009
ACM
16 years 7 months ago
A New Generative Feature Set Based on Entropy Distance for Discriminative Classification
Abstract. Score functions induced by generative models extract fixeddimensions feature vectors from different-length data observations by subsuming the process of data generation, ...
Alessandro Perina, Marco Cristani, Umberto Castell...
KDD
2005
ACM
112views Data Mining» more  KDD 2005»
16 years 7 months ago
Model-based overlapping clustering
While the vast majority of clustering algorithms are partitional, many real world datasets have inherently overlapping clusters. Several approaches to finding overlapping clusters...
Arindam Banerjee, Chase Krumpelman, Joydeep Ghosh,...
SIGMOD
2007
ACM
190views Database» more  SIGMOD 2007»
16 years 7 months ago
Map-reduce-merge: simplified relational data processing on large clusters
Map-Reduce is a programming model that enables easy development of scalable parallel applications to process vast amounts of data on large clusters of commodity machines. Through ...
Hung-chih Yang, Ali Dasdan, Ruey-Lung Hsiao, Dougl...
HRI
2009
ACM
16 years 1 months ago
How to approach humans?: strategies for social robots to initiate interaction
This paper proposes a model of approach behavior with which a robot can initiate conversation with people who are walking. We developed the model by learning from the failures in ...
Satoru Satake, Takayuki Kanda, Dylan F. Glas, Mich...
UM
2009
Springer
16 years 1 months ago
Non-intrusive Personalisation of the Museum Experience
Abstract. The vast amount of information presented in museums is often overwhelming to a visitor, making it difficult to select personally interesting exhibits. Advances in mobile...
Fabian Bohnert, Ingrid Zukerman
« Prev « First page 1448 / 1978 Last » Next »