Sciweavers

324 search results - page 52 / 65
» Network Processing Challenges and an Experimental NPU Platfo...
Sort
View
FPGA
2010
ACM
232views FPGA» more  FPGA 2010»
14 years 9 months ago
High-throughput bayesian computing machine with reconfigurable hardware
We use reconfigurable hardware to construct a high throughput Bayesian computing machine (BCM) capable of evaluating probabilistic networks with arbitrary DAG (directed acyclic gr...
Mingjie Lin, Ilia Lebedev, John Wawrzynek
SENSYS
2006
ACM
15 years 3 months ago
StarDust: a flexible architecture for passive localization in wireless sensor networks
The problem of localization in wireless sensor networks where nodes do not use ranging hardware, remains a challenging problem, when considering the required location accuracy, en...
Radu Stoleru, Pascal Vicaire, Tian He, John A. Sta...
CN
2004
256views more  CN 2004»
14 years 9 months ago
A line in the sand: a wireless sensor network for target detection, classification, and tracking
Intrusion detection is a surveillance problem of practical import that is well suited to wireless sensor networks. In this paper, we study the application of sensor networks to the...
Anish Arora, Prabal Dutta, Sandip Bapat, Vinod Kul...
127
Voted
IPPS
2006
IEEE
15 years 3 months ago
High-performance computing in remotely sensed hyperspectral imaging: the Pixel Purity Index algorithm as a case study
The incorporation of last-generation sensors to airborne and satellite platforms is currently producing a nearly continual stream of high-dimensional data, and this explosion in t...
Antonio Plaza, David Valencia, Javier Plaza
CCO
2001
Springer
161views Combinatorics» more  CCO 2001»
15 years 2 months ago
Branch, Cut, and Price: Sequential and Parallel
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
Laszlo Ladányi, Ted K. Ralphs, Leslie E. Tr...