Sciweavers

63 search results - page 11 / 13
» Efficient Computation of Roots in Finite Fields
Sort
View
SC
1993
ACM
13 years 11 months ago
Solving the Boltzmann equation at 61 gigaflops on a 1024-node CM-5
This paper documents the use of a massively parallel computer, specifically the Connection Machine CM-5, to solve the Boltzmann equation to model one-dimensional shock wave struct...
Lyle N. Long, Jacek Myczkowski
SPAA
2003
ACM
14 years 22 days ago
Quantifying instruction criticality for shared memory multiprocessors
Recent research on processor microarchitecture suggests using instruction criticality as a metric to guide hardware control policies. Fields et al. [3, 4] have proposed a directed...
Tong Li, Alvin R. Lebeck, Daniel J. Sorin
CORR
2010
Springer
105views Education» more  CORR 2010»
13 years 2 months ago
Universal and Robust Distributed Network Codes
Random linear network codes can be designed and implemented in a distributed manner, with low computational complexity. However, these codes are classically implemented [1] over fi...
Tracey Ho, Sidharth Jaggi, Svitlana Vyetrenko, Lin...
GPC
2007
Springer
14 years 1 months ago
Optimal Deployment of Mobile Sensor Networks and Its Maintenance Strategy
Abstract. Sensor network deployment and its maintenance are very challenging due to hostile and unpredictable nature of environments. The field coverage of a wireless sensor networ...
Xiaoling Wu, Jinsung Cho, Brian J. d'Auriol, Sungy...
IBPRIA
2007
Springer
14 years 1 months ago
Bayesian Oil Spill Segmentation of SAR Images Via Graph Cuts
Abstract. This paper extends and generalizes the Bayesian semisupervised segmentation algorithm [1] for oil spill detection using SAR images. In the base algorithm on which we buil...
Sónia Pelizzari, José M. Bioucas-Dia...