Sciweavers

9532 search results - page 343 / 1907
» Logic, Graphs, and Algorithms
Sort
View
VLC
2002
93views more  VLC 2002»
15 years 6 months ago
Metrics for Graph Drawing Aesthetics
Graph layout algorithms typically conform to one or more aesthetic criteria (e.g. minimising the number of bends, maximising orthogonality). Determining the extent to which a grap...
Helen C. Purchase
279
Voted

Book
534views
17 years 4 months ago
Neural Networks - A Systematic Introduction
This book covers the following topics: The biological paradigm, Threshold logic, Weighted Networks, The Perceptron, Perceptron learning, Unsupervised learning and clustering algori...
Raul Rojas
CADE
1999
Springer
15 years 11 months ago
A dynamic programming approach to categorial deduction
We reduce the provability problem of any formula of the Lambek calculus to some context-free parsing problem. This reduction, which is based on non-commutative proof-net theory, al...
Philippe de Groote
SODA
2010
ACM
234views Algorithms» more  SODA 2010»
16 years 4 months ago
PTAS for maximum weight independent set problem with random weights in bounded degree graphs
Finding the largest independent set in a graph is a notoriously difficult NP-complete combinatorial optimization problem. Moreover, even for graphs with largest degree 3, no polyn...
David Gamarnik, David Goldberg, Theophane Weber
SWAT
1994
Springer
130views Algorithms» more  SWAT 1994»
15 years 10 months ago
Dominating Cliques in Distance-Hereditary Graphs
A graph is distance-hereditary if and only if each cycle on five or more vertices has at least two crossing chords. We present linear time algorithms for the minimum r-dominating c...
Feodor F. Dragan