354 search results - page 35 / 71 » jos 2010 |
84
Voted
ENDM
2007
15 years 20 days ago
2007
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...
111
click to vote
TIP
2010
14 years 7 months ago
2010
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...
ENTCS
2007
15 years 14 days ago
2007
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...
96
Voted
LREC
2010
15 years 2 months ago
2010
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...
119
Voted
EOR
2010
15 years 23 days ago
2010
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...