Sciweavers

354 search results - page 35 / 71
» jos 2010
Sort
View
ENDM
2007
75views more  ENDM 2007»
13 years 11 months ago
Graph classes with given 3-connected components: asymptotic counting and critical phenomena
Fix a family T of 3-connected graphs, and let G be the class of graphs whose 3connected components are the graphs in T . We present a general framework for analyzing such graph cl...
Omer Giménez, Marc Noy, Juan José Ru...
TIP
2010
163views more  TIP 2010»
13 years 5 months ago
Fast Image Recovery Using Variable Splitting and Constrained Optimization
We propose a new fast algorithm for solving one of the standard formulations of image restoration and reconstruction which consists of an unconstrained optimization problem where t...
Manya V. Afonso, José M. Bioucas-Dias, M&aa...
ENTCS
2007
123views more  ENTCS 2007»
13 years 10 months ago
Proving Termination of Context-Sensitive Rewriting with MU-TERM
Context-sensitive rewriting (CSR) is a restriction of rewriting which forbids reductions on selected arguments of functions. Proving termination of CSR is an interesting problem w...
Beatriz Alarcón, Raúl Gutiérr...
LREC
2010
150views Education» more  LREC 2010»
14 years 11 days ago
Evaluation of HMM-based Models for the Annotation of Unsegmented Dialogue Turns
Corpus-based dialogue systems rely on statistical models, whose parameters are inferred from annotated dialogues. The dialogues are usually annotated using Dialogue Acts (DA), and...
Carlos D. Martínez-Hinarejos, Vicent Tamari...
EOR
2010
96views more  EOR 2010»
13 years 11 months ago
The hybrid flow shop scheduling problem
The scheduling of flow shops with multiple parallel machines per stage, usually referred to as the Hybrid Flow Shop (HFS), is a complex combinatorial problem encountered in many r...
Rubén Ruiz, José Antonio Vázq...