4865 search results - page 514 / 973 » The Complexity of Graph Connectivity |
172
click to vote
IJON
2006
15 years 7 months ago
2006
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...
172
click to vote
BC
1999
15 years 6 months ago
1999
The essential dynamics of some biological central pattern generators (CPGs) can be captured by a model consisting of x neurons connected in a ring. These circuits, like many oscill...
193
click to vote
SIAMCOMP
1998
15 years 6 months ago
1998
This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP-optimization problems. The emphasis is on p...
210
click to vote
INFOCOM
2007
IEEE
16 years 1 months ago
2007
IEEE
Abstract— The Internet connectivity in the Autonomous System (AS) level reflects the commercial relationship between ASes. A connection between two ASes could be of type custome...
173
click to vote
AMAST
2008
Springer
15 years 9 months ago
2008
Springer
Many complex analysis problems can be most clearly and easily specified as logic rules and queries, where rules specify how given facts can be combined to infer new facts, and quer...