Sciweavers

6110 search results - page 463 / 1222
» Approximate Computing
Sort
View
FOCS
1992
IEEE
15 years 11 months ago
Probabilistic Checking of Proofs; A New Characterization of NP
We give a new characterization of NP: the class NP contains exactly those languages L for which membership proofs (a proof that an input x is in L) can be verified probabilisticall...
Sanjeev Arora, Shmuel Safra
162
Voted
WSC
2004
15 years 9 months ago
Efficient Simulation-Based Discrete Optimization
In many practical applications of simulation it is desirable to optimize the levels of integer or binary variables that are inputs for the simulation model. In these cases, the ob...
Seth D. Guikema, Rachel A. Davidson, Zehra Ç...
CAGD
2005
75views more  CAGD 2005»
15 years 7 months ago
s-power series: an alternative to Poisson expansions for representing analytic functions
Morin and Goldman [Computer Aided Geometric Design 17 (2000) 813] have recently presented a remarkable new framework, based on employing Poisson series, for describing analytic fu...
Javier Sánchez-Reyes, Jesús Miguel C...
ICPR
2004
IEEE
16 years 8 months ago
Motion Analysis Using Frame Differences with Spatial Gradient Measures
The paper considers making inferences about the underlying true 2-D motion when only evaluations of a local block-based cost function, the mean of absolute or squared differences,...
Pekka Sangi, Janne Heikkilä, Olli Silvé...
SPAA
2010
ACM
15 years 8 months ago
Scheduling to minimize power consumption using submodular functions
We develop logarithmic approximation algorithms for extremely general formulations of multiprocessor multiinterval offline task scheduling to minimize power usage. Here each proce...
Erik D. Demaine, Morteza Zadimoghaddam