Sciweavers

138 search results - page 9 / 28
» The Complexity of Quickly ORM-Decidable Sets
Sort
View
JMLR
2012
12 years 8 days ago
Online Incremental Feature Learning with Denoising Autoencoders
While determining model complexity is an important problem in machine learning, many feature learning algorithms rely on cross-validation to choose an optimal number of features, ...
Guanyu Zhou, Kihyuk Sohn, Honglak Lee
ICPR
2010
IEEE
14 years 7 days ago
Fast Training of Object Detection Using Stochastic Gradient Descent
Training datasets for object detection problems are typically very large and Support Vector Machine (SVM) implementations are computationally complex. As opposed to these complex ...
Rob Wijnhoven, Peter H. N. De With
EDBT
2009
ACM
175views Database» more  EDBT 2009»
14 years 4 months ago
Towards materialized view selection for distributed databases
Materialized views (MV) can significantly improve the query performance of relational databases. In this paper, we consider MVs to optimize complex scenarios where many heterogen...
Leonardo Weiss Ferreira Chaves, Erik Buchmann, Fab...
CVPR
2004
IEEE
14 years 12 months ago
Fast Contour Matching Using Approximate Earth Mover's Distance
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...
Kristen Grauman, Trevor Darrell
MM
2009
ACM
137views Multimedia» more  MM 2009»
14 years 4 months ago
A method for rapid personalization of audio equalization parameters
Potential users of audio production software, such as audio equalizers, may be discouraged by the complexity of the interface. We describe a system that simplifies the interface b...
Andrew T. Sabin, Bryan Pardo