Sciweavers

848 search results - page 13 / 170
» Randomness and the linear degrees of computability
Sort
View
87
Voted
MM
2005
ACM
153views Multimedia» more  MM 2005»
15 years 3 months ago
Body degree zero
alization is a combination of abstract generated forms and found imagery. The frequency, amplitude, and percentage differences between samples of incoming data are mapped to forms ...
Alan Dunning, Paul Woodrow, Morley Hollenberg
MOBIHOC
2002
ACM
15 years 9 months ago
On the minimum node degree and connectivity of a wireless multihop network
This paper investigates two fundamental characteristics of a wireless multihop network: its minimum node degree and its k?connectivity. Both topology attributes depend on the spat...
Christian Bettstetter
SIGCOMM
2006
ACM
15 years 3 months ago
Systematic topology analysis and generation using degree correlations
Researchers have proposed a variety of metrics to measure important graph properties, for instance, in social, biological, and computer networks. Values for a particular graph met...
Priya Mahadevan, Dmitri V. Krioukov, Kevin R. Fall...
63
Voted
JC
2011
87views more  JC 2011»
14 years 4 months ago
Lower bounds for the complexity of linear functionals in the randomized setting
Abstract. Hinrichs [3] recently studied multivariate integration defined over reproducing kernel Hilbert spaces in the randomized setting and for the normalized error criterion. I...
Erich Novak, Henryk Wozniakowski
77
Voted
AML
2006
83views more  AML 2006»
14 years 9 months ago
The Medvedev lattice of computably closed sets
Simpson introduced the lattice P of 0 1 classes under Medvedev reducibility. Questions regarding completeness in P are related to questions about measure and randomness. We presen...
Sebastiaan Terwijn