Sciweavers

3600 search results - page 669 / 720
» The settling-time reducibility ordering
Sort
View
AOSD
2009
ACM
14 years 1 months ago
The dataflow pointcut: a formal and practical framework
Some security concerns are sensitive to flow of information in a program execution. The dataflow pointcut has been proposed by Masuhara and Kawauchi in order to easily implement s...
Dima Alhadidi, Amine Boukhtouta, Nadia Belblidia, ...
ANSS
2007
IEEE
14 years 1 months ago
An Accurate and Efficient Time-Division Parallelization of Cycle Accurate Architectural Simulators
This paper proposes a parallel cycle-accurate microarchitectural simulator which efficiently executes its workload by splitting the simulation process along time-axis into many in...
Masahiro Yano, Toru Takasaki, Takashi Nakada, Hiro...
APGV
2007
ACM
130views Visualization» more  APGV 2007»
14 years 1 months ago
A perceptual approach to trimming unstructured lumigraphs
We present a novel perceptual method to reduce the visual redundancy of unstructured lumigraphs, an image based representation designed for interactive rendering. We combine featu...
Yann Morvan, Carol O'Sullivan
ATAL
2007
Springer
14 years 1 months ago
Confidence-based policy learning from demonstration using Gaussian mixture models
We contribute an approach for interactive policy learning through expert demonstration that allows an agent to actively request and effectively represent demonstration examples. I...
Sonia Chernova, Manuela M. Veloso
CCA
2009
Springer
14 years 1 months ago
Effective Choice and Boundedness Principles in Computable Analysis
Abstract. In this paper we study a new approach to classify mathematical theorems according to their computational content. Basically, we are asking the question which theorems can...
Vasco Brattka, Guido Gherardi