Sciweavers

4843 search results - page 446 / 969
» The Shortcut Problem - Complexity and Approximation
Sort
View
ICPR
2004
IEEE
16 years 6 months ago
Automated Visual Identification of Characters in Situation Comedies
The objectives of the work described in this paper are simply stated: given examples of a particular person and an unlabelled video, we wish to find every instance of that person ...
Andrew Zisserman, Mark Everingham
ICML
2007
IEEE
16 years 5 months ago
Most likely heteroscedastic Gaussian process regression
This paper presents a novel Gaussian process (GP) approach to regression with inputdependent noise rates. We follow Goldberg et al.'s approach and model the noise variance us...
Kristian Kersting, Christian Plagemann, Patrick Pf...
156
Voted
EACL
2009
ACL Anthology
16 years 5 months ago
Translation as Weighted Deduction
We present a unified view of many translation algorithms that synthesizes work on deductive parsing, semiring parsing, and efficient approximate search algorithms. This gives rise...
Adam Lopez
VLDB
2006
ACM
162views Database» more  VLDB 2006»
16 years 5 months ago
Dependency trees in sub-linear time and bounded memory
We focus on the problem of efficient learning of dependency trees. Once grown, they can be used as a special case of a Bayesian network, for PDF approximation, and for many other u...
Dan Pelleg, Andrew W. Moore
VLDB
2009
ACM
143views Database» more  VLDB 2009»
16 years 5 months ago
Sampling-based estimators for subset-based queries
We consider the problem of using sampling to estimate the result of an aggregation operation over a subset-based SQL query, where a subquery is correlated to an outer query by a NO...
Shantanu Joshi, Christopher M. Jermaine