Sciweavers

5169 search results - page 158 / 1034
» Locality approximation using time
Sort
View
JMLR
2010
157views more  JMLR 2010»
14 years 11 months ago
Why are DBNs sparse?
Real stochastic processes operating in continuous time can be modeled by sets of stochastic differential equations. On the other hand, several popular model families, including hi...
Shaunak Chatterjee, Stuart Russell
EMNLP
2011
14 years 4 months ago
Approximate Scalable Bounded Space Sketch for Large Data NLP
We exploit sketch techniques, especially the Count-Min sketch, a memory, and time efficient framework which approximates the frequency of a word pair in the corpus without explic...
Amit Goyal, Hal Daumé III
CDC
2010
IEEE
160views Control Systems» more  CDC 2010»
14 years 12 months ago
Adaptive bases for Q-learning
Abstract-- We consider reinforcement learning, and in particular, the Q-learning algorithm in large state and action spaces. In order to cope with the size of the spaces, a functio...
Dotan Di Castro, Shie Mannor
CVPR
2009
IEEE
17 years 2 days ago
Convexity and Bayesian Constrained Local Models
The accurate localization of facial features plays a fundamental role in any face recognition pipeline. Constrained local models (CLM) provide an effective approach to localizati...
Ulrich Paquet (Imense Ltd)
BMAS
2000
IEEE
15 years 9 months ago
A Table-Based Time-Domain Simulation Method for Oversampled Microelectromechanical Systems
This paper describes a table-based behavioral modeling method and an efficient transient simulation method for oversampled MEMS systems. A system is represented by a set of coupl...
Jiangfeng Wu, L. Richard Carley