138 search results - page 19 / 28 » nn 2007 |
COMBINATORICS
2007
14 years 11 months ago
2007
Let G = (V, E) be any d-regular graph with girth g on n vertices, for d ≥ 3. This note shows that G has a maximum matching which includes all but an exponentially small fraction...
ICCS
2007
Springer
15 years 3 months ago
2007
Springer
The clustering coefficient C of a network, which is a measure of direct connectivity between neighbors of the various nodes, ranges from 0 (for no connectivity) to 1 (for full conn...
174
click to vote
GIS
2007
ACM
16 years 14 days ago
2007
ACM
We propose a general framework to index very large datasets of spatial data in a distributed system. Our proposal is built on the recently proposed Scalable Distributed Rtree (SD-...
SACI
2007
IEEE
15 years 5 months ago
2007
IEEE
–This paper proposes that there are ultimately only two topical tactile feedback generation modalities for haptic human interfaces which allow the human operator to handle either...
124
click to vote
ASIAN
2007
Springer
15 years 5 months ago
2007
Springer
Extensive use of computer networks and online electronic data and high demand for security has called for reliable intrusion detection systems. A repertoire of different classifier...