Sciweavers

1554 search results - page 206 / 311
» Parameterized Complexity and Approximation Algorithms
Sort
View
STOC
2010
ACM
224views Algorithms» more  STOC 2010»
15 years 7 months ago
Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
Holger Dell and Dieter van Melkebeek
IPPS
2006
IEEE
15 years 9 months ago
Schedulability analysis of non-preemptive recurring real-time tasks
The recurring real-time task model was recently proposed as a model for real-time processes that contain code with conditional branches. In this paper, we present a necessary and ...
Sanjoy K. Baruah, Samarjit Chakraborty
RTSS
2005
IEEE
15 years 8 months ago
Voltage Scaling Scheduling for Periodic Real-Time Tasks in Reward Maximization
— This paper is interested in reward maximization of periodic real-time tasks under a given energy constraint, where the reward received depends on how much computation a task ru...
Jian-Jia Chen, Tei-Wei Kuo
ICIAR
2005
Springer
15 years 8 months ago
Shape Similarity Measurement for Boundary Based Features
In this study, we propose two algorithms for measuring the distance between shape boundaries. In the algorithms, shape boundary is represented by the Beam Angle Statistics (BAS), w...
Nafiz Arica, Fatos T. Yarman-Vural
ICASSP
2010
IEEE
15 years 3 months ago
Optimal delayed decoding of predictively encoded sources
Predictive coding eliminates redundancy due to correlations between the current and past signal samples, so that only the innovation, or prediction residual, needs to be encoded. ...
Vinay Melkote, Kenneth Rose