Sciweavers

1578 search results - page 191 / 316
» Algorithmic randomness of continuous functions
Sort
View
KDD
2010
ACM
195views Data Mining» more  KDD 2010»
14 years 24 days ago
Universal multi-dimensional scaling
In this paper, we propose a unified algorithmic framework for solving many known variants of MDS. Our algorithm is a simple iterative scheme with guaranteed convergence, and is m...
Arvind Agarwal, Jeff M. Phillips, Suresh Venkatasu...
SIGECOM
2010
ACM
164views ECommerce» more  SIGECOM 2010»
14 years 1 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...
PG
2007
IEEE
14 years 3 months ago
Statistical Hypothesis Testing for Assessing Monte Carlo Estimators: Applications to Image Synthesis
Image synthesis algorithms are commonly compared on the basis of running times and/or perceived quality of the generated images. In the case of Monte Carlo techniques, assessment ...
Kartic Subr, James Arvo
IPL
2006
110views more  IPL 2006»
13 years 8 months ago
Variationally universal hashing
The strongest well-known measure for the quality of a universal hash-function family H is its being -strongly universal, which measures, for randomly chosen h H, one's inabi...
Ted Krovetz, Phillip Rogaway
IPPS
2006
IEEE
14 years 2 months ago
Hash-based proximity clustering for load balancing in heterogeneous DHT networks
DHT networks based on consistent hashing functions have an inherent load uneven distribution problem. The objective of DHT load balancing is to balance the workload of the network...
Haiying Shen, Cheng-Zhong Xu