Sciweavers

4451 search results - page 114 / 891
» On Random Ordering Constraints
Sort
View
APPROX
2008
Springer
125views Algorithms» more  APPROX 2008»
15 years 6 months ago
On the Degree Sequences of Random Outerplanar and Series-Parallel Graphs
In order to perform an average-case analysis for specific input distributions one needs to derive and understand properties of a 'typical' input instance. In the case of...
Nicla Bernasconi, Konstantinos Panagiotou, Angelik...
COMBINATORICS
2004
69views more  COMBINATORICS 2004»
15 years 4 months ago
Convergence in Distribution for Subset Counts Between Random Sets
Erdos posed the problem of how many random subsets need to be chosen from a set of n elements, each element appearing in each subset with probability p = 1/2, in order that at lea...
Dudley Stark
JAT
2010
70views more  JAT 2010»
15 years 2 months ago
Density of eigenvalues and its perturbation invariance in unitary ensembles of random matrices
We generally study the density of eigenvalues in unitary ensembles of random matrices from the recurrence coefficients with regularly varying conditions for the orthogonal polynomi...
Dang-Zheng Liu, Zheng-Dong Wang, Kui-Hua Yan
ICMCS
2006
IEEE
104views Multimedia» more  ICMCS 2006»
15 years 10 months ago
Protection of Video Logos with Randomization
To announce the ownership of video such as TV programs, the owner usually embeds his logo into the programs in a visible way. Since the logo and its position are usually fixed in...
Yongdong Wu
CORR
2007
Springer
123views Education» more  CORR 2007»
15 years 4 months ago
On Distributed Computation in Noisy Random Planar Networks
THIS PAPER IS ELIGIBLE FOR THE STUDENT PAPER AWARD. We consider distributed computation of functions of distributed data in random planar networks with noisy wireless links. We pre...
Yashodhan Kanoria, D. Manjunath