2168 search results - page 11 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
DSN
2011
IEEE
12 years 7 months ago
2011
IEEE
—In this paper we extend the class of MAP queueing networks to include blocking models, which are useful to describe the performance of service instances which have a limited con...
TOC
2008
13 years 7 months ago
2008
Abstract: Schnorr's algorithm for finding an approximation for the shortest nonzero vector in an n-dimensional lattice depends on a parameter k. He proved that for a fixed k ...
DLT
2006
13 years 9 months ago
2006
We investigate the following lower bound methods for regular languages: The fooling set technique, the extended fooling set technique, and the biclique edge cover technique. It is ...
CHI
2011
ACM
12 years 11 months ago
2011
ACM
We lay out one strand of a continuing investigation into the development of a virtual peer to help children learn to use “school English” and “school-ratified science talk...
SI3D
2009
ACM
14 years 2 months ago
2009
ACM
Physically plausible illumination at real-time framerates is often achieved using approximations. One popular example is ambient occlusion (AO), for which very simple and efficie...