Sciweavers

884 search results - page 13 / 177
» Granularity as a Parameter of Context
Sort
View
ICASSP
2011
IEEE
13 years 13 days ago
Maximum a posteriori based regularization parameter selection
The 1 norm regularized least square technique has been proposed as an efficient method to calculate sparse solutions. However, the choice of the regularization parameter is still...
Ashkan Panahi, Mats Viberg
PPSN
2010
Springer
13 years 7 months ago
Fixed Parameter Evolutionary Algorithms and Maximum Leaf Spanning Trees: A Matter of Mutation
Abstract. Evolutionary algorithms have been shown to be very successful for a wide range of NP-hard combinatorial optimization problems. We investigate the NP-hard problem of compu...
Stefan Kratsch, Per Kristian Lehre, Frank Neumann,...
ICIP
2006
IEEE
14 years 10 months ago
Studying Temporal Correlation Noise Modeling for Pixel Based Wyner-Ziv Video Coding
Wyner-Ziv (WZ) video coding ? a particular case of distributed video coding (DVC) ? is a new video coding paradigm based on two major Information Theory results: the Slepian-Wolf ...
Catarina Brites, Fernando Pereira, João Asc...
AAIM
2008
Springer
110views Algorithms» more  AAIM 2008»
14 years 3 months ago
Fixed-Parameter Algorithms for Kemeny Scores
The Kemeny Score problem is central to many applications in the context of rank aggregation. Given a set of permutations (votes) over a set of candidates, one searches for a “con...
Nadja Betzler, Michael R. Fellows, Jiong Guo, Rolf...
WG
2005
Springer
14 years 2 months ago
Fixed-Parameter Algorithms for Protein Similarity Search Under mRNA Structure Constraints
Abstract. In the context of protein engineering, we consider the problem of computing an mRNA sequence of maximal codon-wise similarity to a given mRNA (and consequently, to a give...
Guillaume Blin, Guillaume Fertin, Danny Hermelin, ...