Sciweavers

9716 search results - page 40 / 1944
» The Case for Energy-Proportional Computing
Sort
View
COMPUTER
2008
70views more  COMPUTER 2008»
14 years 10 months ago
User-Generated Content: The Case for Mobile Services
Christian S. Jensen, Carmen Ruiz Vicente, Rico Win...
CORR
1999
Springer
65views Education» more  CORR 1999»
14 years 9 months ago
Unambiguous Computation: Boolean Hierarchies and Sparse Turing-Complete Sets
It is known that for any class C closed under union and intersection, the Boolean closure of C, the Boolean hierarchy over C, and the symmetric difference hierarchy over C all are ...
Lane A. Hemaspaandra, Jörg Rothe
MOC
2002
100views more  MOC 2002»
14 years 9 months ago
Numerical computation of viscous profiles for hyperbolic conservation laws
Viscous profiles of shock waves in systems of conservation laws can be viewed as heteroclinic orbits in associated systems of ordinary differential equations (ODE). In the case of ...
Heinrich Freistühler, Christian Rohde
CAGD
2010
125views more  CAGD 2010»
14 years 7 months ago
Precise Hausdorff distance computation between polygonal meshes
We present an exact algorithm for computing the precise Hausdorff distance between two general polyhedra represented as triangular meshes. The locus of candidate points, events wh...
Michael Barton, Iddo Hanniel, Gershon Elber, Myung...
APPROX
2007
Springer
104views Algorithms» more  APPROX 2007»
15 years 4 months ago
Worst-Case to Average-Case Reductions Revisited
Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and...
Dan Gutfreund, Amnon Ta-Shma