Sciweavers

10805 search results - page 2033 / 2161
» Mapping Computation with No Memory
Sort
View
SIGCOMM
2006
ACM
15 years 9 months ago
Beyond bloom filters: from approximate membership checks to approximate state machines
Many networking applications require fast state lookups in a concurrent state machine, which tracks the state of a large number of flows simultaneously. We consider the question ...
Flavio Bonomi, Michael Mitzenmacher, Rina Panigrah...
BIBE
2005
IEEE
126views Bioinformatics» more  BIBE 2005»
15 years 9 months ago
Highly Scalable and Accurate Seeds for Subsequence Alignment
We propose a method for finding seeds for the local alignment of two nucleotide sequences. Our method uses randomized algorithms to find approximate seeds. We present a dynamic ...
Abhijit Pol, Tamer Kahveci
BROADNETS
2005
IEEE
15 years 9 months ago
Optimal path selection for ethernet over SONET under inaccurate link-state information
— Ethernet over SONET (EoS) is a popular approach for interconnecting geographically distant Ethernet segments using a SONET transport infrastructure. It typically uses virtual c...
Satyajeet Ahuja, Marwan Krunz, Turgay Korkmaz
BROADNETS
2005
IEEE
15 years 9 months ago
A Lightweight framework for source-to-sink data transfer in wireless sensor networks
— Lightweight protocols that are both bandwidth and power thrifty are desirable for sensor networks. In addition, for many sensor network applications, timeliness of data deliver...
James Jobin, Zhenqiang Ye, Honomount Rawat, Srikan...
CODES
2005
IEEE
15 years 9 months ago
Improving superword level parallelism support in modern compilers
Multimedia vector instruction sets are becoming ubiquitous in most of the embedded systems used for multimedia, networking and communications. However, current compiler technology...
Christian Tenllado, Luis Piñuel, Manuel Pri...
« Prev « First page 2033 / 2161 Last » Next »