Sciweavers

18090 search results - page 227 / 3618
» Computing by Only Observing
Sort
View
CVPR
2009
IEEE
17 years 1 months ago
Efficient Planar Graph Cuts with Applications in Computer Vision
We present a fast graph cut algorithm for planar graphs. It is based on the graph theoretical work [2] and leads to an efficient method that we apply on shape matching and im- a...
Daniel Cremers, Eno Töppe, Frank R. Schmidt
CVPR
2005
IEEE
16 years 8 months ago
Computer Vision for Music Identification
We describe how certain tasks in the audio domain can be effectively addressed using computer vision approaches. This paper focuses on the problem of music identification, where t...
Yan Ke, Derek Hoiem, Rahul Sukthankar
ICML
2007
IEEE
16 years 7 months ago
Efficiently computing minimax expected-size confidence regions
Given observed data and a collection of parameterized candidate models, a 1- confidence region in parameter space provides useful insight as to those models which are a good fit t...
Brent Bryan, H. Brendan McMahan, Chad M. Schafer, ...
STOC
2001
ACM
138views Algorithms» more  STOC 2001»
16 years 6 months ago
Fast computation of low rank matrix
Given a matrix A, it is often desirable to find a good approximation to A that has low rank. We introduce a simple technique for accelerating the computation of such approximation...
Dimitris Achlioptas, Frank McSherry
OSDI
2008
ACM
16 years 6 months ago
Predicting Computer System Failures Using Support Vector Machines
Mitigating the impact of computer failure is possible if accurate failure predictions are provided. Resources, applications, and services can be scheduled around predicted failure...
Errin W. Fulp, Glenn A. Fink, Jereme N. Haack