Sciweavers

6 search results - page 1 / 2
» Dimension, Halfspaces, and the Density of Hard Sets
Sort
View
COCOON
2007
Springer
13 years 11 months ago
Dimension, Halfspaces, and the Density of Hard Sets
We use the connection between resource-bounded dimension and the online mistake-bound model of learning to show that the following classes have polynomial-time dimension zero.
Ryan C. Harkins, John M. Hitchcock
AAAI
2012
11 years 7 months ago
Double-Bit Quantization for Hashing
Hashing, which tries to learn similarity-preserving binary codes for data representation, has been widely used for efficient nearest neighbor search in massive databases due to i...
Weihao Kong, Wu-Jun Li
DAGM
2010
Springer
13 years 6 months ago
Gaussian Mixture Modeling with Gaussian Process Latent Variable Models
Density modeling is notoriously difficult for high dimensional data. One approach to the problem is to search for a lower dimensional manifold which captures the main characteristi...
Hannes Nickisch, Carl Edward Rasmussen
SIGGRAPH
2010
ACM
13 years 9 months ago
Video tapestries with continuous temporal zoom
We present a novel approach for summarizing video in the form of a multiscale image that is continuous in both the spatial domain and across the scale dimension: There are no hard...
Connelly Barnes, Dan B. Goldman, Eli Shechtman, Ad...
SENSYS
2004
ACM
13 years 10 months ago
Call and response: experiments in sampling the environment
Monitoring of environmental phenomena with embedded networked sensing confronts the challenges of both unpredictable variability in the spatial distribution of phenomena, coupled ...
Maxim A. Batalin, Mohammad H. Rahimi, Yan Yu, Duo ...