Sciweavers

2512 search results - page 381 / 503
» Learning from Highly Structured Data by Decomposition
Sort
View
AMAI
2005
Springer
14 years 10 months ago
Robust inference of trees
Abstract. This paper is concerned with the reliable inference of optimal treeapproximations to the dependency structure of an unknown distribution generating data. The traditional ...
Marco Zaffalon, Marcus Hutter
CVPR
2008
IEEE
15 years 12 months ago
Sparsity, redundancy and optimal image support towards knowledge-based segmentation
In this paper, we propose a novel approach to model shape variations. It encodes sparsity, exploits geometric redundancy, and accounts for the different degrees of local variation...
Salma Essafi, Georg Langs, Nikos Paragios
HICSS
2002
IEEE
127views Biometrics» more  HICSS 2002»
15 years 2 months ago
Weaving Community with Community Fibre: Community Informatics and the Broadband Revolution
Unexpectedly, the widespread availability of very very high speed (Broadband) bandwidth into communities and within large centres has become not only a long-term possibility but a...
Michael Gurstein
WWW
2004
ACM
15 years 10 months ago
Automatic web news extraction using tree edit distance
The Web poses itself as the largest data repository ever available in the history of humankind. Major efforts have been made in order to provide efficient access to relevant infor...
Davi de Castro Reis, Paulo Braz Golgher, Altigran ...
KDD
2010
ACM
247views Data Mining» more  KDD 2010»
14 years 12 months ago
Metric forensics: a multi-level approach for mining volatile graphs
Advances in data collection and storage capacity have made it increasingly possible to collect highly volatile graph data for analysis. Existing graph analysis techniques are not ...
Keith Henderson, Tina Eliassi-Rad, Christos Falout...