Sciweavers

511 search results - page 90 / 103
» Lower bounds for distributed markov chain problems
Sort
View
SDM
2009
SIAM
157views Data Mining» more  SDM 2009»
15 years 9 months ago
MUSK: Uniform Sampling of k Maximal Patterns.
Recent research in frequent pattern mining (FPM) has shifted from obtaining the complete set of frequent patterns to generating only a representative (summary) subset of frequent ...
Mohammad Al Hasan, Mohammed Javeed Zaki
ICMI
2009
Springer
171views Biometrics» more  ICMI 2009»
15 years 6 months ago
Static vs. dynamic modeling of human nonverbal behavior from multiple cues and modalities
Human nonverbal behavior recognition from multiple cues and modalities has attracted a lot of interest in recent years. Despite the interest, many research questions, including th...
Stavros Petridis, Hatice Gunes, Sebastian Kaltwang...
ICML
2009
IEEE
16 years 15 days 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
ICCAD
1994
IEEE
61views Hardware» more  ICCAD 1994»
15 years 3 months ago
Simultaneous driver and wire sizing for performance and power optimization
In this paper, we study the simultaneousdriver and wire sizing (SDWS) problem under two objective functions: (i) delay minimization only, or (ii) combined delay and power dissipat...
Jason Cong, Cheng-Kok Koh
FORTE
2007
15 years 1 months ago
The DHCP Failover Protocol: A Formal Perspective
Abstract. We present a formal specification and analysis of a faulttolerant DHCP algorithm, used to automatically configure certain host parameters in an IP network. Our algorith...
Rui Fan, Ralph E. Droms, Nancy D. Griffeth, Nancy ...