Sciweavers

9730 search results - page 1698 / 1946
» Relating models of backtracking
Sort
View
137
Voted
CORR
2010
Springer
167views Education» more  CORR 2010»
15 years 5 months ago
Network Flow Algorithms for Structured Sparsity
We consider a class of learning problems that involve a structured sparsityinducing norm defined as the sum of -norms over groups of variables. Whereas a lot of effort has been pu...
Julien Mairal, Rodolphe Jenatton, Guillaume Obozin...
CORR
2008
Springer
105views Education» more  CORR 2008»
15 years 5 months ago
2-D Analysis of Enhancement of Analytes Adsorption Due to Flow Stirring by Electrothermal Force in The Microcantilever Sensor
Ac electrokinetic flows are commonly used for manipulating micron-scale particles in a biosensor system. At the solid-liquid state there are two kinds of processes in the reaction...
Ming-Chih Wu, Jeng-Shian Chang, Chih-Kai Yang
CORR
2010
Springer
140views Education» more  CORR 2010»
15 years 5 months ago
Performance Bounds and Design Criteria for Estimating Finite Rate of Innovation Signals
In this paper, we consider the problem of estimating finite rate of innovation (FRI) signals from noisy measurements, and specifically analyze the interaction between FRI technique...
Zvika Ben-Haim, Tomer Michaeli, Yonina C. Eldar
132
Voted
CSL
2010
Springer
15 years 5 months ago
Randomisation and Derandomisation in Descriptive Complexity Theory
We study probabilistic complexity classes and questions of derandomisation from a logical point of view. For each logic L we introduce a new logic BPL, bounded error probabilistic ...
Kord Eickmeyer, Martin Grohe
CORR
2008
Springer
88views Education» more  CORR 2008»
15 years 5 months ago
Lower bounds for distributed markov chain problems
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
Rahul Sami, Andy Twigg
« Prev « First page 1698 / 1946 Last » Next »