Sciweavers

2299 search results - page 150 / 460
» A Class of Hypercube-Like Networks
Sort
View
TNN
1998
123views more  TNN 1998»
13 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
ICDT
2012
ACM
242views Database» more  ICDT 2012»
12 years 18 days ago
Win-move is coordination-free (sometimes)
In a recent paper by Hellerstein [15], a tight relationship was conjectured between the number of strata of a Datalog¬ program and the number of “coordination stages” require...
Daniel Zinn, Todd J. Green, Bertram Ludäscher
FOCS
1995
IEEE
14 years 1 months ago
Disjoint Paths in Densely Embedded Graphs
We consider the following maximum disjoint paths problem (mdpp). We are given a large network, and pairs of nodes that wish to communicate over paths through the network — the g...
Jon M. Kleinberg, Éva Tardos
DFG
2009
Springer
14 years 4 months ago
Group-Level Analysis and Visualization of Social Networks
Social network analysis investigates the structure of relations amongst social actors. A general approach to detect patterns of interaction and to filter out irregularities is to ...
Michael Baur, Ulrik Brandes, Jürgen Lerner, D...
ICC
2009
IEEE
239views Communications» more  ICC 2009»
14 years 5 months ago
An Analytical Approach for Throughput Evaluation of Wireless Network Coding
In this paper, we propose a new analytical model for throughput evaluation of wireless network coding. This new approach is based on a probabilistic viewpoint on network coding, i....
Mohammad H. Amerimehr, Farid Ashtiani, Mohammad Ba...