Sciweavers

1511 search results - page 87 / 303
» Randomness, lowness and degrees
Sort
View
MLQ
2007
72views more  MLQ 2007»
15 years 5 months ago
Mass problems and almost everywhere domination
We examine the concept of almost everywhere domination from the viewpoint of mass problems. Let AED and MLR be the set of reals which are almost everywhere dominating and Martin-L...
Stephen G. Simpson
APPROX
2006
Springer
120views Algorithms» more  APPROX 2006»
15 years 10 months ago
Approximating Average Parameters of Graphs
Inspired by Feige (36th STOC, 2004), we initiate a study of sublinear randomized algorithms for approximating average parameters of a graph. Specifically, we consider the average ...
Oded Goldreich, Dana Ron
WSC
2008
15 years 8 months ago
Measuring the effectiveness of the s-metric to produce better network models
Recent research has shown that while many complex networks follow a power-law distribution for their node degrees, it is not sufficient to model these networks based only on their...
Isabel Beichl, Brian Cloteaux
TIT
2010
110views Education» more  TIT 2010»
15 years 27 days ago
Secure communications with insecure feedback: breaking the high-SNR ceiling
A multiple-antenna Gaussian wiretap channel in which the number of antennas at the source is not greater than that at the eavesdropper is considered. Without feedback, the secrecy...
Tùng T. Kim, H. Vincent Poor
ICPR
2000
IEEE
16 years 7 months ago
Orbit and Sinus Classification Based on Force Histogram Computation
In a previous work, we defined a new approach to evaluating directional relations between objects (such as "is to the right of", "is above"...). The approach i...
Pascal Matsakis, Laurent Wendling