4037 search results - page 338 / 808 » Routing without ordering |
128
click to vote
IPPS
2006
IEEE
15 years 9 months ago
2006
IEEE
Approximate string matching problem is a common and often repeated task in information retrieval and bioinformatics. This paper proposes a generic design of a programmable array p...
146
Voted
VTC
2006
IEEE
15 years 9 months ago
2006
IEEE
— In order to avoid the large peak transmit power, resulting from the high transmission rates expected for future mobile communication systems, a wireless multi-hop virtual cellu...
133
Voted
ASPLOS
2006
ACM
15 years 9 months ago
2006
ACM
Spatial Computing (SC) has been shown to be an energy-efficient model for implementing program kernels. In this paper we explore the feasibility of using SC for more than small k...
131
click to vote
MINENET
2006
ACM
15 years 9 months ago
2006
ACM
We examine the ability to exploit the hierarchical structure of Internet addresses in order to endow network agents with predictive capabilities. Specifically, we consider Suppor...
145
Voted
SASN
2006
ACM
15 years 9 months ago
2006
ACM
Node misbehavior in wireless ad hoc networks leads to sudden unpredictable changes in network topology, resulting in fluctuation of traffic load and capacity for already existin...