Sciweavers

256 search results - page 22 / 52
» Approximation of the worst-case execution time using structu...
Sort
View
CGF
2008
81views more  CGF 2008»
14 years 12 months ago
Lagrangian Visualization of Flow-Embedded Surface Structures
The powerful yet conceptually simple notions of Finite-Time Lyapunov Exponent (FTLE) and Lagrangian Coherent Structures provide a powerful framework for the analysis and visualiza...
Christoph Garth, Alexander Wiebel, Xavier Tricoche...
97
Voted
CGI
1998
IEEE
15 years 4 months ago
Fast Approximate Quantitative Visibility for Complex Scenes
Ray tracing and Monte-Carlo based global illumination, as well as radiosity and other finite-element based global illumination methods, all require repeated evaluation of quantita...
Yiorgos Chrysanthou, Daniel Cohen-Or, Dani Lischin...
WCET
2010
14 years 9 months ago
Hybrid measurement-based WCET analysis at the source level using object-level traces
Hybrid measurement-based approaches to worst-case execution time (WCET) analysis combine measured execution times of small program segments using static analysis of the larger sof...
Adam Betts, Nicholas Merriam, Guillem Bernat
IFIPTCS
2010
14 years 9 months ago
Approximating the Non-contiguous Multiple Organization Packing Problem
We present in this paper a 5/2-approximation algorithm for scheduling rigid jobs on multi-organizations. For a given set of n jobs, the goal is to construct a schedule for N organi...
Marin Bougeret, Pierre-François Dutot, Klau...
KDD
2009
ACM
173views Data Mining» more  KDD 2009»
16 years 8 days ago
Constant-factor approximation algorithms for identifying dynamic communities
We propose two approximation algorithms for identifying communities in dynamic social networks. Communities are intuitively characterized as "unusually densely knit" sub...
Chayant Tantipathananandh, Tanya Y. Berger-Wolf