Sciweavers

166 search results - page 26 / 34
» Efficient worst case timing analysis of data caching
Sort
View
EMSOFT
2006
Springer
13 years 11 months ago
New approach to architectural synthesis: incorporating QoS constraint
Embedded applications like video decoding, video streaming and those in the network domain, typically have a Quality of Service (QoS) requirement which needs to be met. Apart from...
Harsh Dhand, Basant Kumar Dwivedi, M. Balakrishnan
ICCSA
2004
Springer
14 years 1 months ago
Speculative Parallelization of a Randomized Incremental Convex Hull Algorithm
Finding the fastest algorithm to solve a problem is one of the main issues in Computational Geometry. Focusing only on worst case analysis or asymptotic computations leads to the d...
Marcelo H. Cintra, Diego R. Llanos Ferraris, Bel&e...
CP
2007
Springer
13 years 11 months ago
Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
Alfonso Gerevini, Alessandro Saetti
ISCI
2006
145views more  ISCI 2006»
13 years 7 months ago
Processing count queries over event streams at multiple time granularities
Management and analysis of streaming data has become crucial with its applications in web, sensor data, network traffic data, and stock market. Data streams consist of mostly nume...
Aykut Ünal, Yücel Saygin, Özgü...
JPDC
2006
85views more  JPDC 2006»
13 years 7 months ago
Provable algorithms for parallel generalized sweep scheduling
We present provably efficient parallel algorithms for sweep scheduling, which is a commonly used technique in Radiation Transport problems, and involves inverting an operator by i...
V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Pa...