28888 search results - page 5613 / 5778 » Computability and complexity in analysis |
126
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Estimating characteristics of large graphs via sampling is a vital part of the study of complex networks. Current sampling methods such as (independent) random vertex and random w...
149
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
r of Abstraction (invited lecture) . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 Barbara Liskov Fast Asynchronous Consensus with Optimal Resilience. . . . . . . . . . . ....
157
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
We initiate the study of an interesting aspect of sponsored search advertising, namely the consequences of broad match- a feature where an ad of an advertiser can be mapped to a b...
114
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. Aggregation is an important building block of modern distributed applications, allowing the determination of meaningful properties (e.g. network size, total storage capac...
164
click to vote
CPHYSICS
2010
15 years 3 months ago
2010
We investigate fully parallel Newton-Krylov-Schwarz (NKS) algorithms for solving the large sparse nonlinear systems of equations arising from the finite element discretization of ...