Sciweavers

700 search results - page 96 / 140
» et 2008
Sort
View
JUCS
2008
158views more  JUCS 2008»
13 years 7 months ago
A Linear Time Approximation Algorithm for Ruler Folding Problem
: A chain or n-link is a sequence of n links whose lengths are fixed and are joined together from their endpoints, free to turn about their endpoints, which act as joints. "Ru...
Ali Nourollah, Mohammadreza Razzazi
NECO
2008
170views more  NECO 2008»
13 years 7 months ago
Representational Power of Restricted Boltzmann Machines and Deep Belief Networks
Deep Belief Networks (DBN) are generative neural network models with many layers of hidden explanatory factors, recently introduced by Hinton et al., along with a greedy layer-wis...
Nicolas Le Roux, Yoshua Bengio
TALG
2008
67views more  TALG 2008»
13 years 7 months ago
Structure and linear-time recognition of 4-leaf powers
A graph G is the k-leaf power of a tree T if its vertices are leaves of T such that two vertices are adjacent in G if and only if their distance in T is at most k. Then T is a k-le...
Andreas Brandstädt, Van Bang Le, R. Sritharan
INFORMATICALT
2007
104views more  INFORMATICALT 2007»
13 years 7 months ago
Key Agreement Protocol (KAP) Using Conjugacy and Discrete Logarithm Problems in Group Representation Level
The key agreement protocol based on infinite non-commutative group presentation and representation levels is proposed. Two simultaneous problems in group representation level are ...
Eligijus Sakalauskas, Povilas Tvarijonas, Andrius ...
IPL
2007
71views more  IPL 2007»
13 years 7 months ago
Fault-tolerant analysis of a class of networks
In this paper, we explore the 2-extraconnectivity of a special class of graphs G(G0,G1;M) proposed by Chen et al. [Y.-C. Chen, J.J.M. Tan, L.-H. Hsu, S.-S. Kao, Super-connectivity...
Jun-Ming Xu, Qiang Zhu 0003, Min Xu