Sciweavers

303 search results - page 45 / 61
» Discrete Mathematics for Computer Science, Some Notes
Sort
View
STOC
1993
ACM
123views Algorithms» more  STOC 1993»
13 years 11 months ago
Constructing small sample spaces satisfying given constraints
Abstract. The subject of this paper is nding small sample spaces for joint distributions of n discrete random variables. Such distributions are often only required to obey a certa...
Daphne Koller, Nimrod Megiddo
TOMACS
2011
139views more  TOMACS 2011»
13 years 2 months ago
The double CFTP method
We consider the problem of the exact simulation of random variables Z that satisfy the distributional identity Z L = V Y + (1 − V )Z, where V ∈ [0, 1] and Y are independent, an...
Luc Devroye, Lancelot F. James
SIAMCOMP
2008
107views more  SIAMCOMP 2008»
13 years 7 months ago
Holographic Algorithms
Leslie Valiant recently proposed a theory of holographic algorithms. These novel algorithms achieve exponential speed-ups for certain computational problems compared to naive algo...
Leslie G. Valiant
SDM
2009
SIAM
331views Data Mining» more  SDM 2009»
14 years 4 months ago
Privacy Preservation in Social Networks with Sensitive Edge Weights.
With the development of emerging social networks, such as Facebook and MySpace, security and privacy threats arising from social network analysis bring a risk of disclosure of con...
Jie Wang, Jinze Liu, Jun Zhang, Lian Liu
MP
2007
91views more  MP 2007»
13 years 7 months ago
Set Intersection Theorems and Existence of Optimal Solutions
The question of nonemptiness of the intersection of a nested sequence of closed sets is fundamental in a number of important optimization topics, including the existence of optima...
Dimitri P. Bertsekas, Paul Tseng