430 search results - page 57 / 86 » A New Linearizing Restriction in the Pattern Matching Proble... |
151
Voted
ALGORITHMICA
2002
15 years 3 months ago
2002
We consider the total weighted completion time scheduling problem for parallel identical machines and precedence constraints, P jprecj PwiCi. This important and broad class of pro...
138
Voted
ALENEX
2009
15 years 4 months ago
2009
A tanglegram is a pair of trees whose leaf sets are in oneto-one correspondence; matching leaves are connected by inter-tree edges. In applications such as phylogenetics or hierar...
154
Voted
IWCIA
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. In this paper, we address the problem of computing a canonical representation of an n-dimensional combinatorial map. To do so, we define two combinatorial map signatures...
148
Voted
ICIP
2008
IEEE
16 years 5 months ago
2008
IEEE
We consider the problem of reconstructing time sequences of spatially sparse signals (with unknown and time-varying sparsity patterns) from a limited number of linear "incohe...
132
click to vote
IJCNN
2006
IEEE
15 years 9 months ago
2006
IEEE
— In connectionist learning, one relevant problem is “catastrophic forgetting” that may occur when a network, trained with a large set of patterns, has to learn new input pat...