Sciweavers

88 search results - page 6 / 18
» Regular Cost Functions over Finite Trees
Sort
View
ICPR
2004
IEEE
14 years 10 months ago
Detection of Artificial Structures in Natural-Scene Images Using Dynamic Trees
We seek a framework that addresses localization, detection and recognition of man-made objects in natural-scene images in a unified manner. We propose to model artificial structur...
Michael C. Nechyba, Sinisa Todorovic
SIAMDM
2008
105views more  SIAMDM 2008»
13 years 9 months ago
Average Spectra and Minimum Distances of Low-Density Parity-Check Codes over Abelian Groups
Ensembles of regular low-density parity-check codes over any finite Abelian group G are studied. The nonzero entries of the parity matrix are randomly chosen, independently and uni...
Giacomo Como, Fabio Fagnani
ISBI
2007
IEEE
14 years 3 months ago
Space-Time Sparsity Regularization for the Magnetoencephalography Inverse Problem
The concept of “Space-Time Sparsity” (STS) penalization is introduced for solving the magnetoencephalography (MEG) inverse problem. The STS approach assumes that events of int...
Andrew K. Bolstad, Barry D. Van Veen, Robert D. No...
ISAAC
2010
Springer
253views Algorithms» more  ISAAC 2010»
13 years 7 months ago
Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut
Abstract. We consider the Steiner tree problem under a 2-stage stochastic model with recourse and finitely many scenarios (SSTP). Thereby, edges are purchased in the first stage wh...
Immanuel M. Bomze, Markus Chimani, Michael Jü...
FSTTCS
2010
Springer
13 years 7 months ago
Expressiveness of streaming string transducers
Streaming string transducers [1] define (partial) functions from input strings to output strings. A streaming string transducer makes a single pass through the input string and us...
Rajeev Alur, Pavol Cerný