Sciweavers

1449 search results - page 210 / 290
» Self-Randomized Exponentiation Algorithms
Sort
View
ICML
2007
IEEE
16 years 7 months ago
Manifold-adaptive dimension estimation
Intuitively, learning should be easier when the data points lie on a low-dimensional submanifold of the input space. Recently there has been a growing interest in algorithms that ...
Amir Massoud Farahmand, Csaba Szepesvári, J...
ICML
2005
IEEE
16 years 7 months ago
Bayesian hierarchical clustering
We present a novel algorithm for agglomerative hierarchical clustering based on evaluating marginal likelihoods of a probabilistic model. This algorithm has several advantages ove...
Katherine A. Heller, Zoubin Ghahramani
EDBT
2006
ACM
103views Database» more  EDBT 2006»
16 years 6 months ago
Finding Equivalent Rewritings in the Presence of Arithmetic Comparisons
The problem of rewriting queries using views has received significant attention because of its applications in a wide variety of datamanagement problems. For select-project-join SQ...
Foto N. Afrati, Rada Chirkova, Manolis Gergatsouli...
CVPR
2010
IEEE
16 years 2 months ago
Fast Globally Optimal 2D Human Detection with Loopy Graph Models
This paper presents an algorithm for recovering the globally optimal 2D human figure detection using a loopy graph model. This is computationally challenging because the time comp...
Tai-Peng Tian, Stan Sclaroff
WALCOM
2010
IEEE
290views Algorithms» more  WALCOM 2010»
16 years 1 months ago
The Covert Set-Cover Problem with Application to Network Discovery
We address a version of the set-cover problem where we do not know the sets initially (and hence referred to as covert) but we can query an element to find out which sets contain ...
Sandeep Sen, V. N. Muralidhara