Sciweavers

736 search results - page 52 / 148
» Approximating the Number of Network Motifs
Sort
View
ESANN
2000
14 years 11 months ago
An algorithm for the addition of time-delayed connections to recurrent neural networks
: Recurrent neural networks possess interesting universal approximation capabilities, making them good candidates for time series modeling. Unfortunately, long term dependencies ar...
Romuald Boné, Michel Crucianu, Jean Pierre ...
CIAC
2006
Springer
103views Algorithms» more  CIAC 2006»
15 years 1 months ago
Provisioning a Virtual Private Network Under the Presence of Non-communicating Groups
Virtual private network design in the hose model deals with the reservation of capacities in a weighted graph such that the terminals in this network can communicate with one anoth...
Friedrich Eisenbrand, Edda Happ
STOC
2006
ACM
180views Algorithms» more  STOC 2006»
15 years 10 months ago
Pricing for fairness: distributed resource allocation for multiple objectives
In this paper, we present a simple distributed algorithm for resource allocation which simultaneously approximates the optimum value for a large class of objective functions. In p...
Sung-woo Cho, Ashish Goel
INFOCOM
2007
IEEE
15 years 4 months ago
Joint Channel Allocation, Interface Assignment and MAC Design for Multi-Channel Wireless Mesh Networks
— In a wireless mesh network (WMN) with a number of stationary wireless routers, the aggregate capacity can be increased when each router is equipped with multiple network interf...
Amir Hamed Mohsenian Rad, Vincent W. S. Wong
DMSN
2004
ACM
15 years 3 months ago
Optimization of in-network data reduction
We consider the in-network computation of approximate “big picture” summaries in bandwidth-constrained sensor networks. First we review early work on computing the Haar wavele...
Joseph M. Hellerstein, Wei Wang