Sciweavers

619 search results - page 93 / 124
» On computational limitations of neural network architectures
Sort
View
ICPP
2006
IEEE
14 years 2 months ago
Designing Multithreaded Algorithms for Breadth-First Search and st-connectivity on the Cray MTA-2
stractions are extensively used to understand and solve challenging computational problems in various scientific and engineering domains. They have particularly gained prominence...
David A. Bader, Kamesh Madduri
INFOCOM
2007
IEEE
14 years 3 months ago
Small Active Counters
— The need for efficient counter architecture has arisen for the following two reasons. Firstly, a number of data streaming algorithms and network management applications requir...
Rade Stanojevic
MOBIHOC
2008
ACM
14 years 8 months ago
An approximation algorithm for conflict-aware broadcast scheduling in wireless ad hoc networks
Broadcast scheduling is a fundamental problem in wireless ad hoc networks. The objective of a broadcast schedule is to deliver a message from a given source to all other nodes in ...
Reza Mahjourian, Feng Chen, Ravi Tiwari, My T. Tha...
EENERGY
2010
14 years 20 days ago
Mobile networks unplugged
Mobile network access has seemingly become ubiquitous in industrialized countries. With data services becoming sufficiently fast, usable, and affordable, demand is growing rapidly...
Jukka Manner, Marko Luoma, Jörg Ott, Jyri H&a...
SIGMETRICS
2011
ACM
229views Hardware» more  SIGMETRICS 2011»
12 years 11 months ago
Model-driven optimization of opportunistic routing
Opportunistic routing aims to improve wireless performance by exploiting communication opportunities arising by chance. A key challenge in opportunistic routing is how to achieve ...
Eric Rozner, Mi Kyung Han, Lili Qiu, Yin Zhang