Sciweavers

2434 search results - page 125 / 487
» Algorithmic Randomness of Closed Sets
Sort
View
94
Voted
RANDOM
1998
Springer
15 years 7 months ago
A Derandomization Using Min-Wise Independent Permutations
abstract for submission to Random '98 not for distribution Andrei Z. Broder Moses Charikar Michael Mitzenmacher Min-wise independence is a recently introduced notion of limit...
Andrei Z. Broder, Moses Charikar, Michael Mitzenma...
165
Voted
PROPERTYTESTING
2010
15 years 1 months ago
On Constant Time Approximation of Parameters of Bounded Degree Graphs
How well can the maximum size of an independent set, or the minimum size of a dominating set of a graph in which all degrees are at most d be approximated by a randomized constant...
Noga Alon
133
Voted
SPAA
2006
ACM
15 years 9 months ago
Playing push vs pull: models and algorithms for disseminating dynamic data in networks
Consider a network in which a collection of source nodes maintain and periodically update data objects for a collection of sink nodes, each of which periodically accesses the data...
R. C. Chakinala, Abishek Kumarasubramanian, Kofi A...
129
Voted
ICIP
2000
IEEE
16 years 5 months ago
Maximum Entropy Image Restoration Revisited
This paper presents a new non-iterative, closed-form approximation to the maximum entropy (M.E.) image restoration method. A fast frequency domain implementation of this closed fo...
Matthew Willis, Brian D. Jeffs, David G. Long
116
Voted
ICA
2007
Springer
15 years 9 months ago
Modeling and Estimation of Dependent Subspaces with Non-radially Symmetric and Skewed Densities
We extend the Gaussian scale mixture model of dependent subspace source densities to include non-radially symmetric densities using Generalized Gaussian random variables linked by ...
Jason A. Palmer, Kenneth Kreutz-Delgado, Bhaskar D...