2168 search results - page 61 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
141
Voted
DSN
2003
IEEE
15 years 8 months ago
2003
IEEE
Energy constrained complex real-time systems are becoming increasingly important in defense, space, and consumer applications. In this paper, we present a sensible heuristic to ad...
103
click to vote
FOCS
2008
IEEE
15 years 10 months ago
2008
IEEE
We show that the NP-Complete language 3SAT has a PCP verifier that makes two queries to a proof of almost-linear size and achieves sub-constant probability of error o(1). The ver...
133
Voted
ICIP
2009
IEEE
16 years 4 months ago
2009
IEEE
Sparse Orthonormal Transforms (SOT) has recently been proposed as a data compression method that can achieve sparser representations in transform domain. Given initial conditions,...
125
click to vote
ICCAD
2004
IEEE
16 years 12 days ago
2004
IEEE
—This paper introduces a simple method for calculating the times at which any signal crosses a prespecified threshold voltage (e.g., 10%, 20%, 50%, etc.) directly from the moment...
138
Voted
DCOSS
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. We propose a distributed scheme called Adaptive-GroupMerge for sensor networks that, given a parameter k, approximates a geometric shape by a k-vertex polygon. The algori...