Sciweavers

830 search results - page 34 / 166
» Approximation power of directionlets
Sort
View
ISVLSI
2008
IEEE
149views VLSI» more  ISVLSI 2008»
14 years 2 months ago
Uncriticality-Directed Low-Power Instruction Scheduling
Intelligent mobile information devices require lowpower and high-performance processors. In order to reduce energy consumption with maintaining computing performance, we proposed ...
Shingo Watanabe, Toshinori Sato
ICALP
2004
Springer
14 years 1 months ago
The Power of Verification for One-Parameter Agents
We initiate the study of mechanisms with veriļ¬cation for one-parameter agents. We give an algorithmic characterization of such mechanisms and show that they are provably better ...
Vincenzo Auletta, Roberto De Prisco, Paolo Penna, ...
ICASSP
2011
IEEE
12 years 11 months ago
Multiple-channel detection of a Gaussian time series over frequency-flat channels
This work addresses the problem of deciding whether a set of realizations of a vector-valued time series with unknown temporal correlation are spatially correlated or not. Speciļ¬...
David Ramírez, Javier Vía, Ignacio S...
FOCS
2005
IEEE
14 years 1 months ago
Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring
At the core of the seminal Graph Minor Theory of Robertson and Seymour is a powerful structural theorem capturing the structure of graphs excluding a ļ¬xed minor. This result is ...
Erik D. Demaine, Mohammad Taghi Hajiaghayi, Ken-ic...
COCOON
2007
Springer
14 years 1 months ago
Priority Algorithms for the Subset-Sum Problem
Greedy algorithms are simple, but their relative power is not well understood. The priority framework [5] captures a key notion of ā€œgreedinessā€ in the sense that it processes (...
Yuli Ye, Allan Borodin