Sciweavers

510 search results - page 25 / 102
» Complexity measures and decision tree complexity: a survey
Sort
View
SIGPRO
2011
209views Hardware» more  SIGPRO 2011»
13 years 3 months ago
Surveying and comparing simultaneous sparse approximation (or group-lasso) algorithms
In this paper, we survey and compare different algorithms that, given an overcomplete dictionary of elementary functions, solve the problem of simultaneous sparse signal approxim...
A. Rakotomamonjy
SOFSEM
2005
Springer
14 years 1 months ago
Discovering Treewidth
Abstract. Treewidth is a graph parameter with several interesting theoretical and practical applications. This survey reviews algorithmic results on determining the treewidth of a ...
Hans L. Bodlaender
TCS
2008
13 years 8 months ago
Fine hierarchies and m-reducibilities in theoretical computer science
This is a survey of results about versions of fine hierarchies and many-one reducibilities that appear in different parts of theoretical computer science. These notions and relate...
Victor L. Selivanov
ICMCS
2006
IEEE
157views Multimedia» more  ICMCS 2006»
14 years 2 months ago
RD-Optimization for MPEG-2 to H.264 Transcoding
1 In this paper, we introduce and evaluate a low complexity macroblock partition mode decision algorithm for interframe prediction in MPEG-2 to H.264 transcoder. The proposed tools...
Gerardo Fernández-Escribano, Hari Kalva, Pe...
STOC
2002
ACM
115views Algorithms» more  STOC 2002»
14 years 8 months ago
Reimer's inequality and tardos' conjecture
Let f : {0, 1}n {0, 1} be a boolean function. For 0 let D (f) be the minimum depth of a decision tree for f that makes an error for fraction of the inputs x {0, 1}n . We also ma...
Clifford D. Smyth