Sciweavers

100 search results - page 11 / 20
» Fast Approximate Energy Minimization with Label Costs
Sort
View
ASPDAC
2004
ACM
118views Hardware» more  ASPDAC 2004»
14 years 1 months ago
Fast and efficient voltage scheduling by evolutionary slack distribution
- To minimize energy consumption by voltage scaling in design of heterogeneousreal-time embeddedsystems, it is necessary to perfom two distinct tasks: task scheduling (TS) and volt...
Bita Gorjiara, Pai H. Chou, Nader Bagherzadeh, Meh...
ACCV
2010
Springer
13 years 3 months ago
Four Color Theorem for Fast Early Vision
Recent work on early vision such as image segmentation, image restoration, stereo matching, and optical flow models these problems using Markov Random Fields. Although this formula...
Radu Timofte, Luc J. Van Gool
SMI
2006
IEEE
106views Image Analysis» more  SMI 2006»
14 years 2 months ago
Fast Sampling of Implicit Surfaces by Particle Systems
Particle systems, as originally proposed by Witkin and Heckbert [17], are a powerful way to sample implicit surfaces since they generate almost evenly distributed samples over the...
Florian Levet, Xavier Granier, Christophe Schlick
ESA
2009
Springer
149views Algorithms» more  ESA 2009»
14 years 3 months ago
Approximability of OFDMA Scheduling
In this paper, we study the complexity and approximability of the orthogonal frequency-division multiple access (OFDMA) scheduling problem with uniformly related communication chan...
Marcel Ochel, Berthold Vöcking
INFOCOM
2009
IEEE
14 years 3 months ago
Robust Counting Via Counter Braids: An Error-Resilient Network Measurement Architecture
—A novel counter architecture, called Counter Braids, has recently been proposed for accurate per-flow measurement on high-speed links. Inspired by sparse random graph codes, Co...
Yi Lu, Balaji Prabhakar