Sciweavers

1542 search results - page 26 / 309
» The metamathematics of random graphs
Sort
View
CORR
2011
Springer
194views Education» more  CORR 2011»
14 years 4 months ago
Energy-Latency Tradeoff for In-Network Function Computation in Random Networks
—The problem of designing policies for in-network function computation with minimum energy consumption subject to a latency constraint is considered. The scaling behavior of the ...
Paul N. Balister, Béla Bollobás, Ani...
ML
2010
ACM
141views Machine Learning» more  ML 2010»
14 years 8 months ago
Relational retrieval using a combination of path-constrained random walks
Scientific literature with rich metadata can be represented as a labeled directed graph. This graph representation enables a number of scientific tasks such as ad hoc retrieval o...
Ni Lao, William W. Cohen
LATIN
2000
Springer
15 years 1 months ago
Small Maximal Matchings in Random Graphs
We look at the minimal size of a maximal matching in general, bipartite and
Michele Zito
AML
2004
94views more  AML 2004»
14 years 9 months ago
The cofinality of the saturated uncountable random graph
Assuming CH, let 1 be the saturated random graph of cardinal
Steve Warner
CDC
2010
IEEE
186views Control Systems» more  CDC 2010»
14 years 4 months ago
Approximation and limiting behavior of random models
In this paper, we investigate limiting behavior of linear dynamic systems driven by random stochastic matrices. We introduce and study the new concepts of partial ergodicity and 1-...
Behrouz Touri, Angelia Nedic