Sciweavers

236 search results - page 15 / 48
» Learning How to Propagate Using Random Probing
Sort
View
ICPR
2008
IEEE
14 years 9 months ago
Image objects and multi-scale features for annotation detection
This paper investigates several issues in the problem of detecting handwritten markings, or annotations, on printed documents. One issue is to define the appropriate units over wh...
Eric Saund, Jindong Chen, Yizhou Wang
ICML
2003
IEEE
14 years 8 months ago
Random Projection for High Dimensional Data Clustering: A Cluster Ensemble Approach
We investigate how random projection can best be used for clustering high dimensional data. Random projection has been shown to have promising theoretical properties. In practice,...
Xiaoli Zhang Fern, Carla E. Brodley
NIPS
2004
13 years 9 months ago
Modelling Uncertainty in the Game of Go
Go is an ancient oriental game whose complexity has defeated attempts to automate it. We suggest using probability in a Bayesian sense to model the uncertainty arising from the va...
David H. Stern, Thore Graepel, David J. C. MacKay
IDA
2009
Springer
14 years 2 months ago
Estimating Markov Random Field Potentials for Natural Images
Markov Random Field (MRF) models with potentials learned from the data have recently received attention for learning the low-level structure of natural images. A MRF provides a pri...
Urs Köster, Jussi T. Lindgren, Aapo Hyvä...
CORR
2010
Springer
249views Education» more  CORR 2010»
13 years 7 months ago
Lower Bounds on Near Neighbor Search via Metric Expansion
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
Rina Panigrahy, Kunal Talwar, Udi Wieder