Sciweavers

2512 search results - page 34 / 503
» Learning from Highly Structured Data by Decomposition
Sort
View
MLMI
2007
Springer
15 years 3 months ago
Automatic Annotation of Dialogue Structure from Simple User Interaction
Abstract. In [1], we presented a method for automatic detection of action items from natural conversation. This method relies on supervised classification techniques that are trai...
Matthew Purver, John Niekrasz, Patrick Ehlen
GIS
2007
ACM
15 years 10 months ago
Multi-scale dual morse complexes for representing terrain morphology
We propose a new multi-scale terrain model, based on a hierarchical representation for the morphology of a terrain. The basis of our morphological model is a dual Morse decomposit...
Emanuele Danovaro, Leila De Floriani, Maria Vitali...
IJCAI
1997
14 years 11 months ago
Is Nonparametric Learning Practical in Very High Dimensional Spaces?
Many of the challenges faced by the £eld of Computational Intelligence in building intelligent agents, involve determining mappings between numerous and varied sensor inputs and ...
Gregory Z. Grudic, Peter D. Lawrence
VIS
2008
IEEE
214views Visualization» more  VIS 2008»
15 years 11 months ago
Estimating Crossing Fibers: A Tensor Decomposition Approach
Diffusion weighted magnetic resonance imaging is a unique tool for non-invasive investigation of major nerve fiber tracts. Since the popular diffusion tensor (DT-MRI) model is limi...
Thomas Schultz, Hans-Peter Seidel
KDD
2009
ACM
178views Data Mining» more  KDD 2009»
15 years 10 months ago
Catching the drift: learning broad matches from clickthrough data
Identifying similar keywords, known as broad matches, is an important task in online advertising that has become a standard feature on all major keyword advertising platforms. Eff...
Sonal Gupta, Mikhail Bilenko, Matthew Richardson