Sciweavers

122 search results - page 23 / 25
» On pancyclism in hamiltonian graphs
Sort
View
FOCS
2003
IEEE
14 years 3 months ago
On the Implementation of Huge Random Objects
We initiate a general study of pseudo-random implementations of huge random objects, and apply it to a few areas in which random objects occur naturally. For example, a random obj...
Oded Goldreich, Shafi Goldwasser, Asaf Nussboim
COMPGEOM
2004
ACM
14 years 3 months ago
Single-strip triangulation of manifolds with arbitrary topology
Triangle strips have been widely used for efficient rendering. It is NP-complete to test whether a given triangulated model can be represented as a single triangle strip, so many...
David Eppstein, M. Gopi
RECOMB
2004
Springer
14 years 10 months ago
A random graph approach to NMR sequential assignment
Nuclear magnetic resonance (NMR) spectroscopy allows scientists to study protein structure, dynamics and interactions in solution. A necessary first step for such applications is ...
Chris Bailey-Kellogg, Sheetal Chainraj, Gopal Pand...
ICANN
2009
Springer
14 years 4 months ago
Spectra of the Spike Flow Graphs of Recurrent Neural Networks
Recently the notion of power law networks in the context of neural networks has gathered considerable attention. Some empirical results show that functional correlation networks in...
Filip Piekniewski
PC
2000
96views Management» more  PC 2000»
13 years 9 months ago
Multicast communication in wormhole-routed star graph interconnection networks
Multicast, an important communication mechanism, is frequently applied in parallel computing. The star graph interconnection network, when compared with the hypercube network, bei...
Tzung-Shi Chen, Neng-Chung Wang, Chih-Ping Chu