Sciweavers

245 search results - page 26 / 49
» The reproducing placement problem with applications
Sort
View
ASPLOS
2009
ACM
16 years 13 days ago
CTrigger: exposing atomicity violation bugs from their hiding places
Multicore hardware is making concurrent programs pervasive. Unfortunately, concurrent programs are prone to bugs. Among different types of concurrency bugs, atomicity violation bu...
Soyeon Park, Shan Lu, Yuanyuan Zhou
CVIU
2006
168views more  CVIU 2006»
14 years 11 months ago
Automated camera layout to satisfy task-specific and floor plan-specific coverage requirements
In many multi-camera vision systems the effect of camera locations on the task-specific quality of service is ignored. Researchers in Computational Geometry have proposed elegant ...
Ugur Murat Erdem, Stan Sclaroff
ALT
2004
Springer
15 years 8 months ago
Relative Loss Bounds and Polynomial-Time Predictions for the k-lms-net Algorithm
We consider a two-layer network algorithm. The first layer consists of an uncountable number of linear units. Each linear unit is an LMS algorithm whose inputs are first “kerne...
Mark Herbster
FPGA
2001
ACM
139views FPGA» more  FPGA 2001»
15 years 4 months ago
A memory coherence technique for online transient error recovery of FPGA configurations
The partial reconfiguration feature of some of the currentgeneration Field Programmable Gate Arrays (FPGAs) can improve dependability by detecting and correcting errors in onchip ...
Wei-Je Huang, Edward J. McCluskey
SIGCOMM
2005
ACM
15 years 5 months ago
Using redundancy to cope with failures in a delay tolerant network
We consider the problem of routing in a delay tolerant network (DTN) in the presence of path failures. Previous work on DTN routing has focused on using precisely known network dy...
Sushant Jain, Michael J. Demmer, Rabin K. Patra, K...