Sciweavers

183 search results - page 14 / 37
» The Degree Distribution of Random k-Trees
Sort
View
69
Voted
TIT
2008
89views more  TIT 2008»
14 years 11 months ago
Lautum Information
A popular way to measure the degree of dependence between two random objects is by their mutual information, defined as the divergence between the joint and product-of-marginal dis...
Daniel Pérez Palomar, Sergio Verdú
STACS
2009
Springer
15 years 4 months ago
Almost-Uniform Sampling of Points on High-Dimensional Algebraic Varieties
We consider the problem of uniform sampling of points on an algebraic variety. Specifically, we develop a randomized algorithm that, given a small set of multivariate polynomials ...
Mahdi Cheraghchi, Amin Shokrollahi
ISPDC
2007
IEEE
15 years 6 months ago
Fully Distributed Active and Passive Task Management for Grid Computing
The task management is a key point in grid applications and can highly influence their efficiency. There are many solutions that we can classify according to their centralizatio...
Alain Bui, Olivier Flauzac, Cyril Rabat
MASCOTS
2001
15 years 1 months ago
Large-Scale Simulation of Replica Placement Algorithms for a Serverless Distributed File System
Farsite is a scalable, distributed file system that logically functions as a centralized file server but that is physically implemented on a set of client desktop computers. Farsi...
John R. Douceur, Roger Wattenhofer
ISSAC
2007
Springer
130views Mathematics» more  ISSAC 2007»
15 years 5 months ago
On probabilistic analysis of randomization in hybrid symbolic-numeric algorithms
Algebraic randomization techniques can be applied to hybrid symbolic-numeric algorithms. Here we consider the problem of interpolating a sparse rational function from noisy values...
Erich Kaltofen, Zhengfeng Yang, Lihong Zhi