Sciweavers

563 search results - page 53 / 113
» Computing approximate PSD factorizations
Sort
View
SIGUCCS
2003
ACM
14 years 3 months ago
Implementation of fee-based printing in student computing sites
After years of providing no-cost printing in its computing sites, the University of Delaware (UD) decided to move to a fee-based printing scheme for its student computing sites. T...
Carol Jarom, Steven J. Timmins
SIGECOM
2010
ACM
164views ECommerce» more  SIGECOM 2010»
14 years 2 months ago
Truthful mechanisms with implicit payment computation
It is widely believed that computing payments needed to induce truthful bidding is somehow harder than simply computing the allocation. We show that the opposite is true for singl...
Moshe Babaioff, Robert D. Kleinberg, Aleksandrs Sl...
CPHYSICS
2006
128views more  CPHYSICS 2006»
13 years 10 months ago
MOMDIS: a Glauber model computer code for knockout reactions
A computer program is described to calculate momentum distributions in stripping and diffraction dissociation reactions. A Glauber model is used with the scattering wavefunctions ...
C. A. Bertulani, A. Gade
FOCS
2000
IEEE
14 years 2 months ago
Stable Distributions, Pseudorandom Generators, Embeddings and Data Stream Computation
In this article, we show several results obtained by combining the use of stable distributions with pseudorandom generators for bounded space. In particular: —We show that, for a...
Piotr Indyk
WDAG
2009
Springer
94views Algorithms» more  WDAG 2009»
14 years 2 months ago
Local Computation of Nearly Additive Spanners
Abstract. An (α, β)-spanner of a graph G is a subgraph H that approximates distances in G within a multiplicative factor α and an additive error β, ensuring that for any two no...
Bilel Derbel, Cyril Gavoille, David Peleg, Laurent...