Sciweavers

2512 search results - page 360 / 503
» Learning from Highly Structured Data by Decomposition
Sort
View
ESA
1998
Springer
169views Algorithms» more  ESA 1998»
15 years 2 months ago
Augmenting Suffix Trees, with Applications
Information retrieval and data compression are the two main application areas where the rich theory of string algorithmics plays a fundamental role. In this paper, we consider one ...
Yossi Matias, S. Muthukrishnan, Süleyman Cenk...
IFIP12
2004
14 years 11 months ago
Introducing a Star Topology into Latent Class Models for Collaborative Filtering
Latent class models (LCM) represent the high dimensional data in a smaller dimensional space in terms of latent variables. They are able to automatically discover the patterns from...
Gabriela Polcicova, Peter Tiño
VMV
2001
93views Visualization» more  VMV 2001»
14 years 11 months ago
On-the-Fly Adaptive Subdivision Terrain
In this paper we present a method to achieve interactive rendering of smooth terrain based on coarse data. Therefore we use adaptive subdivision surfaces which are calculated on t...
Dirc Rose, Martin Kada, Thomas Ertl
CVPR
2009
IEEE
16 years 5 months ago
Co-training with Noisy Perceptual Observations
Many perception and multimedia indexing problems involve datasets that are naturally comprised of multiple streams or modalities for which supervised training data is only sparsely...
Ashish Kapoor, Chris Mario Christoudias, Raquel Ur...
KDD
2009
ACM
153views Data Mining» more  KDD 2009»
15 years 10 months ago
Predicting bounce rates in sponsored search advertisements
This paper explores an important and relatively unstudied quality measure of a sponsored search advertisement: bounce rate. The bounce rate of an ad can be informally defined as t...
D. Sculley, Robert G. Malkin, Sugato Basu, Roberto...