8512 search results - page 188 / 1703 » Computing Theory With Relevance |
114
click to vote
NIPS
2000
15 years 6 months ago
2000
We introduce total wire length as salient complexity measure for an analysis of the circuit complexity of sensory processing in biological neural systems and neuromorphic engineer...
124
click to vote
COMBINATORICS
1999
15 years 4 months ago
1999
Kasteleyn stated that the generating function of the perfect matchings of a graph of genus g may be written as a linear combination of 4g Pfaffians. Here we prove this statement. ...
156
click to vote
INLG
2010
Springer
15 years 2 months ago
2010
Springer
Today there exist a growing number of framenet-like resources offering semantic and syntactic phrase specifications that can be exploited by natural language generation systems. I...
151
click to vote
FOSSACS
2011
Springer
14 years 8 months ago
2011
Springer
To the best of our knowledge, we characterize for the first time the importance of resources (counters, channels, alphabets) when measuring expressiveness of WSTS. We establish, f...
118
click to vote
ACSC
2006
IEEE
15 years 10 months ago
2006
IEEE
Modern computer networks contain an amalgamation of devices and technologies, with the performance exhibited by each central to digital communications. Varieties of methods exist ...