Sciweavers

683 search results - page 90 / 137
» Generalization Bounds for Learning Kernels
Sort
View
COLT
2010
Springer
13 years 7 months ago
Forest Density Estimation
We study graph estimation and density estimation in high dimensions, using a family of density estimators based on forest structured undirected graphical models. For density estim...
Anupam Gupta, John D. Lafferty, Han Liu, Larry A. ...
PODS
2004
ACM
137views Database» more  PODS 2004»
14 years 10 months ago
On the Memory Requirements of XPath Evaluation over XML Streams
The important challenge of evaluating XPath queries over XML streams has sparked much interest in the past few years. A number of algorithms have been proposed, supporting wider f...
Ziv Bar-Yossef, Marcus Fontoura, Vanja Josifovski

Publication
233views
12 years 8 months ago
Sparse reward processes
We introduce a class of learning problems where the agent is presented with a series of tasks. Intuitively, if there is relation among those tasks, then the information gained duri...
Christos Dimitrakakis
ICCV
2005
IEEE
14 years 3 months ago
Learning Models for Predicting Recognition Performance
This paper addresses one of the fundamental problems encountered in performance prediction for object recognition. In particular we address the problems related to estimation of s...
Rong Wang, Bir Bhanu
ENTCS
2007
119views more  ENTCS 2007»
13 years 9 months ago
Interpolant Learning and Reuse in SAT-Based Model Checking
Bounded Model Checking (BMC) is one of the most paradigmatic practical applications of Boolean Satisfiability (SAT). The utilization of SAT in model checking has allowed signifi...
João Marques-Silva