Sciweavers

61 search results - page 2 / 13
» Efficient Run-Time Monitoring of Timing Constraints
Sort
View
WSC
2001
13 years 6 months ago
Efficient simulation for discrete path-dependent option pricing
In this paper we present an algorithm for simulating functions of the minimum and terminal value for a random walk with Gaussian increments. These expectations arise in connection...
James M. Calvin
DAC
2005
ACM
14 years 6 months ago
An efficient algorithm for statistical minimization of total power under timing yield constraints
Power minimization under variability is formulated as a rigorous statistical robust optimization program with a guarantee of power and timing yields. Both power and timing metrics...
Murari Mani, Anirudh Devgan, Michael Orshansky
ICMCS
2007
IEEE
123views Multimedia» more  ICMCS 2007»
13 years 11 months ago
Efficient Parallelization of H.264 Decoding with Macro Block Level Scheduling
The H.264 decoder has a sequential, control intensive front end that makes it difficult to leverage the potential performance of emerging manycore processors. Preparsing is a fun...
Jike Chong, Nadathur Satish, Bryan C. Catanzaro, K...
JUCS
2006
121views more  JUCS 2006»
13 years 5 months ago
On-line Monitoring of Metric Temporal Logic with Time-Series Constraints Using Alternating Finite Automata
: In this paper we describe a technique for monitoring and checking temporal logic assertions augmented with real-time and time-series constraints, or Metric Temporal Logic Series ...
Doron Drusinsky
SIGMOD
2005
ACM
254views Database» more  SIGMOD 2005»
14 years 5 months ago
Conceptual Partitioning: An Efficient Method for Continuous Nearest Neighbor Monitoring
Given a set of objects P and a query point q, a k nearest neighbor (k-NN) query retrieves the k objects in P that lie closest to q. Even though the problem is well-studied for sta...
Kyriakos Mouratidis, Marios Hadjieleftheriou, Dimi...