Sciweavers

835 search results - page 147 / 167
» Adaptive Bound Optimization for Online Convex Optimization
Sort
View
SIGMOD
2004
ACM
126views Database» more  SIGMOD 2004»
14 years 10 months ago
Indexing Spatio-Temporal Trajectories with Chebyshev Polynomials
In this paper, we attempt to approximate and index a ddimensional (d 1) spatio-temporal trajectory with a low order continuous polynomial. There are many possible ways to choose ...
Yuhan Cai, Raymond T. Ng
TACAS
2005
Springer
88views Algorithms» more  TACAS 2005»
14 years 3 months ago
Shortest Counterexamples for Symbolic Model Checking of LTL with Past
Shorter counterexamples are typically easier to understand. The length of a counterexample, as reported by a model checker, depends on both the algorithm used for state space explo...
Viktor Schuppan, Armin Biere
DATE
2010
IEEE
153views Hardware» more  DATE 2010»
14 years 3 months ago
Taming the component timing: A CBD methodology for real-time embedded systems
—The growing trend towards using component based design approach in embedded system development requires addressing newer system engineering challenges. These systems are usually...
Manoj G. Dixit, Pallab Dasgupta, S. Ramesh
BDA
2003
13 years 11 months ago
Memory Requirements for Query Execution in Highly Constrained Devices
Pervasive computing introduces data management requirements that must be tackled in a growingvariety of lightweight computing devices. Personal folders on chip, networks of sensor...
Nicolas Anciaux, Luc Bouganim, Philippe Pucheral
CGF
2008
139views more  CGF 2008»
13 years 10 months ago
CHC++: Coherent Hierarchical Culling Revisited
We present a new algorithm for efficient occlusion culling using hardware occlusion queries. The algorithm significantly improves on previous techniques by making better use of te...
Oliver Mattausch, Jirí Bittner, Michael Wim...