Sciweavers

1201 search results - page 150 / 241
» Linear Probing and Graphs
Sort
View
DAC
1999
ACM
15 years 10 months ago
Circuit Complexity Reduction for Symbolic Analysis of Analog Integrated Circuits
This paper presents a method to reduce the complexity of a linear or linearized (small-signal) analog circuit. The reduction technique, based on quality-error ranking, can be used...
Walter Daems, Georges G. E. Gielen, Willy M. C. Sa...
ESA
1998
Springer
169views Algorithms» more  ESA 1998»
15 years 10 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...
COCO
1997
Springer
144views Algorithms» more  COCO 1997»
15 years 10 months ago
Polynomial Vicinity Circuits and Nonlinear Lower Bounds
We study families of Boolean circuits with the property that the number of gates at distance t fanning into or out of any given gate in a circuit is bounded above by a polynomial ...
Kenneth W. Regan
ESCIENCE
2006
IEEE
15 years 9 months ago
Jylab: A System for Portable Scientific Computing over Distributed Platforms
Jylab is a portable and flexible scientific computing system favoring extensibility. It provides a user with a scripting language and a core set of libraries implementing numerica...
Giorgios Kollias, Efstratios Gallopoulos
DISOPT
2008
113views more  DISOPT 2008»
15 years 6 months ago
The inverse 1-median problem on a cycle
Abstract. Let the graph G = (V, E) be a cycle with n + 1 vertices, nonnegative vertex weights and positive edge lengths. The inverse 1-median problem on a cycle consists in changin...
Rainer E. Burkard, Carmen Pleschiutschnig, Jianzho...