Sciweavers

467 search results - page 3 / 94
» How much can hardware help routing
Sort
View
NN
1998
Springer
108views Neural Networks» more  NN 1998»
13 years 5 months ago
How embedded memory in recurrent neural network architectures helps learning long-term temporal dependencies
Learning long-term temporal dependencies with recurrent neural networks can be a difficult problem. It has recently been shown that a class of recurrent neural networks called NA...
Tsungnan Lin, Bill G. Horne, C. Lee Giles
ICCAD
2009
IEEE
92views Hardware» more  ICCAD 2009»
13 years 3 months ago
How to consider shorts and guarantee yield rate improvement for redundant wire insertion
This paper accurately considers wire short defects and proposes an algorithm to guarantee IC chip yield rate improvement for redundant wire insertion. Without considering yield ra...
Fong-Yuan Chang, Ren-Song Tsay, Wai-Kei Mak
MSWIM
2006
ACM
13 years 11 months ago
Establishing how many VoIP calls a wireless LAN can support without performance degradation
The use of Voice IP (VoIP) over wireless local area networks (WLAN) is a topic of great interest in the research arena. This paper attempts to answer the question: how many VoIP c...
Ángel Cuevas Rumín, Eur Ing Chris Gu...
INFOCOM
1998
IEEE
13 years 10 months ago
Routing Lookups in Hardware at Memory Access Speeds
Increased bandwidth in the Internet puts great demands on network routers; for example, to route minimum sized Gigabit Ethernet packets, an IP router must process about packets pe...
Pankaj Gupta, Steven Lin, Nick McKeown
JOIN
2007
96views more  JOIN 2007»
13 years 5 months ago
Universal Routing and Performance Assurance for Distributed Networks
In this paper, we show that universal routing can be achieved with low overhead in distributed networks. The validity of our results rests on a new network called the fat-stack. W...
Kevin F. Chen, Edwin Hsing-Mean Sha