Sciweavers

9842 search results - page 1601 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
DAC
2002
ACM
16 years 7 months ago
High-Level specification and automatic generation of IP interface monitors
A central problem in functional verification is to check that a circuit block is producing correct outputs while enforcing that the environment is providing legal inputs. To attac...
Marcio T. Oliveira, Alan J. Hu
DAC
2006
ACM
16 years 7 months ago
Leakage power reduction of embedded memories on FPGAs through location assignment
Transistor leakage is poised to become the dominant source of power dissipation in digital systems, and reconfigurable devices are not immune to this problem. Modern FPGAs already...
Yan Meng, Timothy Sherwood, Ryan Kastner
ICML
2009
IEEE
16 years 7 months ago
Near-Bayesian exploration in polynomial time
We consider the exploration/exploitation problem in reinforcement learning (RL). The Bayesian approach to model-based RL offers an elegant solution to this problem, by considering...
J. Zico Kolter, Andrew Y. Ng
207
Voted
ICML
2007
IEEE
16 years 7 months ago
Full regularization path for sparse principal component analysis
Given a sample covariance matrix, we examine the problem of maximizing the variance explained by a particular linear combination of the input variables while constraining the numb...
Alexandre d'Aspremont, Francis R. Bach, Laurent El...
ICML
2007
IEEE
16 years 7 months ago
Non-isometric manifold learning: analysis and an algorithm
In this work we take a novel view of nonlinear manifold learning. Usually, manifold learning is formulated in terms of finding an embedding or `unrolling' of a manifold into ...
Piotr Dollár, Serge J. Belongie, Vincent Ra...
« Prev « First page 1601 / 1969 Last » Next »