Sciweavers

51986 search results - page 10317 / 10398
» Are There New Models of Computation
Sort
View
CF
2006
ACM
15 years 6 months ago
Exploiting locality to ameliorate packet queue contention and serialization
Packet processing systems maintain high throughput despite relatively high memory latencies by exploiting the coarse-grained parallelism available between packets. In particular, ...
Sailesh Kumar, John Maschmeyer, Patrick Crowley
IWRIDL
2006
ACM
141views Education» more  IWRIDL 2006»
15 years 6 months ago
Shallow syntax analysis in Sanskrit guided by semantic nets constraints
We present the state of the art of a computational platform for the analysis of classical Sanskrit. The platform comprises modules for phonology, morphology, segmentation and shal...
Gérard P. Huet
112
Voted
MOBICOM
2006
ACM
15 years 6 months ago
Optimal CWmin selection for achieving proportional fairness in multi-rate 802.11e WLANs: test-bed implementation and evaluation
We investigate the optimal selection of minimum contention window values to achieve proportional fairness in a multirate IEEE 802.11e test-bed. Unlike other approaches, the propos...
Vasilios A. Siris, George Stamatakis
SASN
2006
ACM
15 years 6 months ago
RANBAR: RANSAC-based resilient aggregation in sensor networks
We present a novel outlier elimination technique designed for sensor networks. This technique is called RANBAR and it is based on the RANSAC (RANdom SAmple Consensus) paradigm, wh...
Levente Buttyán, Péter Schaffer, Ist...
SENSYS
2006
ACM
15 years 6 months ago
Run-time dynamic linking for reprogramming wireless sensor networks
From experience with wireless sensor networks it has become apparent that dynamic reprogramming of the sensor nodes is a useful feature. The resource constraints in terms of energ...
Adam Dunkels, Niclas Finne, Joakim Eriksson, Thiem...
« Prev « First page 10317 / 10398 Last » Next »