Sciweavers

1119 search results - page 109 / 224
» Computing in the Presence of Timing Failures
Sort
View
ECCV
2004
Springer
14 years 9 months ago
Probabilistic Multi-view Correspondence in a Distributed Setting with No Central Server
Abstract. We present a probabilistic algorithm for finding correspondences across multiple images. The algorithm runs in a distributed setting, where each camera is attached to a s...
Shai Avidan, Yael Moses, Yoram Moses
ASPLOS
2009
ACM
14 years 8 months ago
Anomaly-based bug prediction, isolation, and validation: an automated approach for software debugging
Software defects, commonly known as bugs, present a serious challenge for system reliability and dependability. Once a program failure is observed, the debugging activities to loc...
Martin Dimitrov, Huiyang Zhou
INFOCOM
2009
IEEE
14 years 2 months ago
CFP: Cooperative Fast Protection
—We introduce a novel protection scheme, called Cooperative Fast Protection (CFP), to fight against a single link failure in survivable WDM (Wavelength Division Multiplexing) mes...
Bin Wu, Pin-Han Ho, Kwan L. Yeung, János Ta...
CISS
2011
IEEE
12 years 11 months ago
Hardware accelerated visual attention algorithm
— We present a hardware-accelerated implementation of a bottom-up visual attention algorithm. This algorithm generates a multi-scale saliency map from differences in image intens...
Polina Akselrod, Faye Zhao, Ifigeneia Derekli, Cl&...
DATE
2009
IEEE
89views Hardware» more  DATE 2009»
14 years 2 months ago
Robust non-preemptive hard real-time scheduling for clustered multicore platforms
—Scheduling task graphs under hard (end-to-end) timing constraints is an extensively studied NP-hard problem of critical importance for predictable software mapping on Multiproce...
Michele Lombardi, Michela Milano, Luca Benini