Sciweavers

877 search results - page 7 / 176
» Full Abstraction for HOPLA
Sort
View
ACIVS
2009
Springer
13 years 5 months ago
Enhanced Low-Resolution Pruning for Fast Full-Search Template Matching
Abstract. Gharavi-Alkhansari [1] proposed a full-search equivalent algorithm for speeding-up template matching based on Lp-norm distance measures. This algorithm performs a pruning...
Stefano Mattoccia, Federico Tombari, Luigi di Stef...
ASPLOS
2008
ACM
13 years 9 months ago
Understanding and visualizing full systems with data flow tomography
It is not uncommon for modern systems to be composed of a variety of interacting services, running across multiple machines in such a way that most developers do not really unders...
Shashidhar Mysore, Bita Mazloom, Banit Agrawal, Ti...
DLOG
2010
13 years 5 months ago
Checking Full Satisfiability of Conceptual Models
Abstract. UML class diagrams (UCDs) are the de-facto standard formalism for the analysis and design of information systems. By adopting formal language techniques to capture constr...
Alessandro Artale, Diego Calvanese, Yazmin Ang&eac...
AIPR
2008
IEEE
13 years 9 months ago
Full body tracking using an agent-based architecture
We present an agent-based full body tracking and 3D animation system to generate motion data using stereo calibrated cameras. The novelty of our approach is that agents are bound t...
Bing Fang, Liguang Xie, Pak-Kiu Chung, Yong Cao, F...
POPL
1996
ACM
13 years 11 months ago
A Provably Time-Efficient Parallel Implementation of Full Speculation
that defines abstract costs for measuring or analyzing the performance of computations, (2) to supply the users with a mapping of these costs onto runtimes on various machine model...
John Greiner, Guy E. Blelloch