414 search results - page 54 / 83 » On discrete norms of polynomials |
SODA
2010
ACM
14 years 7 months ago
2010
ACM
We investigate the preemptive scheduling of periodic tasks with hard deadlines. We show that, even in the uniprocessor case, no polynomial time algorithm can test the feasibility ...
SODA
2010
ACM
14 years 7 months ago
2010
ACM
If a two-player social welfare maximization problem does not admit a PTAS, we prove that any maximal-in-range truthful mechanism that runs in polynomial time cannot achieve an app...
COMPGEOM
2004
ACM
14 years 3 months ago
2004
ACM
We present a new algorithm for unfolding planar polygonal linkages without self-intersection based on following the gradient flow of a “repulsive” energy function. This algor...
ACNS
2006
Springer
14 years 1 months ago
2006
Springer
Abstract. Several researchers have proposed the use of threshold cryptographic model to enable secure communication in ad hoc networks without the need of a trusted center. In this...
ASPDAC
2005
ACM
13 years 12 months ago
2005
ACM
Abstract— Frequency dependent interconnect analysis is challenging since lumped equivalent circuit models extracted at different frequencies exhibit distinct time and frequency d...