Sciweavers

46 search results - page 8 / 10
» A Discovery Algorithm for Directed Cyclic Graphs
Sort
View
TNN
1998
123views more  TNN 1998»
14 years 9 months ago
A general framework for adaptive processing of data structures
—A structured organization of information is typically required by symbolic processing. On the other hand, most connectionist models assume that data are organized according to r...
Paolo Frasconi, Marco Gori, Alessandro Sperduti
PPOPP
2010
ACM
15 years 6 months ago
A distributed placement service for graph-structured and tree-structured data
Effective data placement strategies can enhance the performance of data-intensive applications implemented on high end computing clusters. Such strategies can have a significant i...
Gregory Buehrer, Srinivasan Parthasarathy, Shirish...
KDD
2004
ACM
124views Data Mining» more  KDD 2004»
15 years 10 months ago
Eigenspace-based anomaly detection in computer systems
We report on an automated runtime anomaly detection method at the application layer of multi-node computer systems. Although several network management systems are available in th...
Hisashi Kashima, Tsuyoshi Idé
JCT
1998
193views more  JCT 1998»
14 years 9 months ago
Fractional Kernels in Digraphs
The aim of this note is to point out some combinatorial applications of a lemma of Scarf, proved first in the context of game theory. The usefulness of the lemma in combinatorics...
Ron Aharoni, Ron Holzman
MOBICOM
2006
ACM
15 years 3 months ago
Boundary recognition in sensor networks by topological methods
Wireless sensor networks are tightly associated with the underlying environment in which the sensors are deployed. The global topology of the network is of great importance to bot...
Yue Wang, Jie Gao, Joseph S. B. Mitchell