Sciweavers

14548 search results - page 2540 / 2910
» The Optimal Path-Matching Problem
Sort
View
SPAA
2006
ACM
16 years 21 days ago
On space-stretch trade-offs: upper bounds
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...
Ittai Abraham, Cyril Gavoille, Dahlia Malkhi
INFOCOM
2005
IEEE
16 years 10 days ago
Designing wireless radio access networks for third generation cellular networks
— In third generation (3G) cellular networks, base stations are connected to base station controllers by pointto-point (usually T1/E1) links. However, today’s T1/E1 based backh...
Tian Bu, Mun Choon Chan, Ramachandran Ramjee
INFOCOM
2005
IEEE
16 years 10 days ago
Smart power-saving mode for IEEE 802.11 wireless LANs
StaticPSM (Power-Saving Mode)schemes employed in the current IEEE 802.11 implementations could not provide any delag-performance guarantee because of their fixed wakeup intervals. ...
Daji Qiao, Kang G. Shin
IPPS
2005
IEEE
16 years 10 days ago
Automatic Support for Irregular Computations in a High-Level Language
The problem of writing high performance parallel applications becomes even more challenging when irregular, sparse or adaptive methods are employed. In this paper we introduce com...
Jimmy Su, Katherine A. Yelick
ISCA
2005
IEEE
134views Hardware» more  ISCA 2005»
16 years 10 days ago
A High Throughput String Matching Architecture for Intrusion Detection and Prevention
Network Intrusion Detection and Prevention Systems have emerged as one of the most effective ways of providing security to those connected to the network, and at the heart of alm...
Lin Tan, Timothy Sherwood
« Prev « First page 2540 / 2910 Last » Next »