Sciweavers

2008 search results - page 338 / 402
» Computing with Equations
Sort
View
ICASSP
2009
IEEE
14 years 5 months ago
Robust-SL0 for stable sparse representation in noisy settings
In the last few years, we have witnessed an explosion in applications of sparse representation, the majority of which share the need for finding sparse solutions of underdetermine...
Armin Eftekhari, Massoud Babaie-Zadeh, Christian J...
CALCO
2009
Springer
159views Mathematics» more  CALCO 2009»
14 years 4 months ago
Complete Iterativity for Algebras with Effects
Abstract. Completely iterative algebras (cias) are those algebras in which recursive equations have unique solutions. In this paper we study complete iterativity for algebras with ...
Stefan Milius, Thorsten Palm, Daniel Schwencke
COCO
2009
Springer
98views Algorithms» more  COCO 2009»
14 years 4 months ago
Extractors for Varieties
We study the task of randomness extraction from sources which are distributed uniformly on an unknown algebraic variety. In other words, we are interested in constructing a functi...
Zeev Dvir
SCIA
2009
Springer
161views Image Analysis» more  SCIA 2009»
14 years 4 months ago
A Fast Optimization Method for Level Set Segmentation
Abstract. Level set methods are a popular way to solve the image segmentation problem in computer image analysis. A contour is implicitly represented by the zero level of a signed ...
Thord Andersson, Gunnar Läthén, Reiner...
HYBRID
2010
Springer
14 years 4 months ago
On the connections between PCTL and dynamic programming
Probabilistic Computation Tree Logic (PCTL) is a wellknown modal logic which has become a standard for expressing temporal properties of finite-state Markov chains in the context...
Federico Ramponi, Debasish Chatterjee, Sean Summer...