Sciweavers

251 search results - page 19 / 51
» Constructive Linear Time Algorithms for Branchwidth
Sort
View
ESA
1998
Springer
169views Algorithms» more  ESA 1998»
15 years 3 months ago
Augmenting Suffix Trees, with Applications
Information retrieval and data compression are the two main application areas where the rich theory of string algorithmics plays a fundamental role. In this paper, we consider one ...
Yossi Matias, S. Muthukrishnan, Süleyman Cenk...
IPL
2010
71views more  IPL 2010»
14 years 10 months ago
New common ancestor problems in trees and directed acyclic graphs
We derive a new generalization of lowest common ancestors (LCAs) in dags, called the lowest single common ancestor (LSCA). We show how to preprocess a static dag in linear time su...
Johannes Fischer, Daniel H. Huson
ISPD
1997
ACM
68views Hardware» more  ISPD 1997»
15 years 3 months ago
Faster minimization of linear wirelength for global placement
A linear wirelength objective more e ectively captures timing, congestion, and other global placement considerations than a squared wirelength objective. The GORDIAN-L cell placem...
Charles J. Alpert, Tony F. Chan, Dennis J.-H. Huan...
117
Voted
NN
2000
Springer
192views Neural Networks» more  NN 2000»
14 years 11 months ago
A new algorithm for learning in piecewise-linear neural networks
Piecewise-linear (PWL) neural networks are widely known for their amenability to digital implementation. This paper presents a new algorithm for learning in PWL networks consistin...
Emad Gad, Amir F. Atiya, Samir I. Shaheen, Ayman E...
77
Voted
ESA
2009
Springer
98views Algorithms» more  ESA 2009»
15 years 6 months ago
Reconstructing 3-Colored Grids from Horizontal and Vertical Projections Is NP-hard
We consider the problem of coloring a grid using k colors with the restriction that in each row and each column has an specific number of cells of each color. In an already classi...
Christoph Dürr, Flavio Guiñez, Mart&ia...