Sciweavers

569 search results - page 88 / 114
» Online Bounds for Bayesian Algorithms
Sort
View
JMLR
2006
118views more  JMLR 2006»
14 years 9 months ago
Learning Factor Graphs in Polynomial Time and Sample Complexity
We study the computational and sample complexity of parameter and structure learning in graphical models. Our main result shows that the class of factor graphs with bounded degree...
Pieter Abbeel, Daphne Koller, Andrew Y. Ng
STACS
2009
Springer
15 years 4 months ago
Nonclairvoyant Speed Scaling for Flow and Energy
We study online nonclairvoyant speed scaling to minimize total flow time plus energy. We first consider the traditional model where the power function is P(s) = sα . We give a ...
Ho-Leung Chan, Jeff Edmonds, Tak Wah Lam, Lap-Kei ...
EUC
2004
Springer
15 years 3 months ago
Power-Aware Scheduling of Mixed Task Sets in Priority-Driven Systems
We propose power-aware on-line task scheduling algorithms for mixed task sets which consist of both periodic and aperiodic tasks. The proposed algorithms utilize the execution beha...
Dongkun Shin, Jihong Kim
TVLSI
2008
116views more  TVLSI 2008»
14 years 9 months ago
GOP-Level Dynamic Thermal Management in MPEG-2 Decoding
In this paper, we present a dynamic thermal management (DTM) algorithm based on (i) accurate estimation of the workload of frames in a group of pictures (GOP) in an MPEG-2 video st...
Wonbok Lee, Kimish Patel, Massoud Pedram
BMCBI
2007
105views more  BMCBI 2007»
14 years 9 months ago
Finding regulatory elements and regulatory motifs: a general probabilistic framework
Over the last two decades a large number of algorithms has been developed for regulatory motif finding. Here we show how many of these algorithms, especially those that model bind...
Erik van Nimwegen