Sciweavers

1512 search results - page 54 / 303
» connection 2006
Sort
View
IJON
2006
79views more  IJON 2006»
14 years 9 months ago
Fast computation with neural oscillators
This paper studies new spike-based models for winner-take-all computation and coincidence detection. In both cases, very fast convergence is achieved independent of initial condit...
Wei Wang 0008, Jean-Jacques E. Slotine
COMBINATORICS
2004
103views more  COMBINATORICS 2004»
14 years 9 months ago
On the Counting of Fully Packed Loop Configurations: Some New Conjectures
New conjectures are proposed on the numbers of FPL configurations pertaining to certain types of link patterns. Making use of the Razumov and Stroganov Ansatz, these conjectures a...
Jean-Bernard Zuber
APPML
2006
80views more  APPML 2006»
14 years 9 months ago
Unicyclic graphs with exactly two main eigenvalues
An eigenvalue of a graph G is called a main eigenvalue if it has an eigenvector the sum of whose entries is not equal to zero, and it is well known that a graph has exactly one ma...
Yaoping Hou, Feng Tian
FFA
2010
139views more  FFA 2010»
14 years 8 months ago
Coset bounds for algebraic geometric codes
We develop new coset bounds for algebraic geometric codes. The bounds have a natural interpretation as an adversary threshold for algebraic geometric secret sharing schemes and le...
Iwan M. Duursma, Seungkook Park
ISCC
2006
IEEE
127views Communications» more  ISCC 2006»
15 years 3 months ago
Visualizing and Managing Network Topologies via Rectangular Dualization
Rectangular dualization is an effective, hierarchically oriented visualization method for network topologies and can be used in many other problems having in common with networks ...
Massimo Ancona, Walter Cazzola, Sara Drago, Gianlu...