Sciweavers

1994 search results - page 309 / 399
» Computation of Optical Flow Using Dynamic Programming
Sort
View
ICALP
2003
Springer
15 years 3 months ago
Anycasting in Adversarial Systems: Routing and Admission Control
Abstract. In this paper we consider the problem of routing packets in dynamically changing networks, using the anycast mode. In anycasting, a packet may have a set of destinations ...
Baruch Awerbuch, André Brinkmann, Christian...
ICSE
2008
IEEE-ACM
15 years 10 months ago
Testing pervasive software in the presence of context inconsistency resolution services
Pervasive computing software adapts its behavior according to the changing contexts. Nevertheless, contexts are often noisy. Context inconsistency resolution provides a cleaner pe...
Heng Lu, W. K. Chan, T. H. Tse
IPPS
2007
IEEE
15 years 4 months ago
Virtual Execution Environments: Support and Tools
In today’s dynamic computing environments, the available resources and even underlying computation engine can change during the execution of a program. Additionally, current tre...
Apala Guha, Jason Hiser, Naveen Kumar, Jing Yang, ...
PLDI
1999
ACM
15 years 2 months ago
Load-Reuse Analysis: Design and Evaluation
Load-reuse analysis finds instructions that repeatedly access the same memory location. This location can be promoted to a register, eliminating redundant loads by reusing the re...
Rastislav Bodík, Rajiv Gupta, Mary Lou Soff...
ICPR
2002
IEEE
15 years 2 months ago
Feature Extraction Methods Applied to the Clustering of Electrocardiographic Signals. A Comparative Study
In this paper, a method to automatically extract the main information from a long-term electrocardiographic signal is presented. This method is based on techniques of pattern reco...
David Cuesta-Frau, Juan Carlos Pérez-Cortes...