Sciweavers

430 search results - page 57 / 86
» A New Linearizing Restriction in the Pattern Matching Proble...
Sort
View
ALGORITHMICA
2002
120views more  ALGORITHMICA 2002»
13 years 7 months ago
An Experimental Study of Algorithms for Weighted Completion Time Scheduling
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...
Ivan D. Baev, Waleed Meleis, Alexandre E. Eichenbe...
ALENEX
2009
106views Algorithms» more  ALENEX 2009»
13 years 9 months ago
Drawing Binary Tanglegrams: An Experimental Evaluation
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...
Martin Nöllenburg, Markus Völker, Alexan...
IWCIA
2009
Springer
14 years 2 months ago
Signatures of Combinatorial Maps
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...
Stéphane Gosselin, Guillaume Damiand, Chris...
ICIP
2008
IEEE
14 years 9 months ago
Kalman filtered Compressed Sensing
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...
Namrata Vaswani
IJCNN
2006
IEEE
14 years 1 months ago
Adaptation of Artificial Neural Networks Avoiding Catastrophic Forgetting
— 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...
Dario Albesano, Roberto Gemello, Pietro Laface, Fr...