Sciweavers

6598 search results - page 171 / 1320
» Graph Theory with Applications
Sort
View
FROCOS
2007
Springer
16 years 17 days ago
Combining Algorithms for Deciding Knowledge in Security Protocols
Abstract. In formal approaches, messages sent over a network are usually modeled by terms together with an equational theory, axiomatizing the properties of the cryptographic funct...
Mathilde Arnaud, Véronique Cortier, St&eacu...
COLT
1994
Springer
15 years 10 months ago
Rigorous Learning Curve Bounds from Statistical Mechanics
In this paper we introduce and investigate a mathematically rigorous theory of learning curves that is based on ideas from statistical mechanics. The advantage of our theory over ...
David Haussler, H. Sebastian Seung, Michael J. Kea...
CAAN
2007
Springer
16 years 18 days ago
Vertex Pursuit Games in Stochastic Network Models
Abstract. Random graphs with given expected degrees G(w) were introduced by Chung and Lu so as to extend the theory of classical G(n, p) random graphs to include random power law g...
Anthony Bonato, Pawel Pralat, Changping Wang
NIPS
1996
15 years 7 months ago
Are Hopfield Networks Faster than Conventional Computers?
It is shown that conventional computers can be exponentially faster than planar Hopfield networks: although there are planar Hopfield networks that take exponential time to conver...
Ian Parberry, Hung-Li Tseng
JAL
2002
99views more  JAL 2002»
15 years 6 months ago
Kayles and Nimbers
Kayles is a combinatorial game on graphs. Two players select alternatingly a vertex from a given graph G - a chosen vertex may not be adjacent or equal to an already chosen vertex...
Hans L. Bodlaender, Dieter Kratsch