13214 search results - page 366 / 2643 » Pseudorandomness for network algorithms |
227
click to vote
PODC
2010
ACM
15 years 10 months ago
2010
ACM
An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approx...
186
Voted
ESA
2000
Springer
15 years 10 months ago
2000
Springer
The p-center problem is to locate p facilities on a network so as to minimize the largest distance from a demand point to its nearest facility. The p-median problem is to locate p ...
226
click to vote
WAN
1998
Springer
15 years 10 months ago
1998
Springer
We present a model for the parallel performance of algorithms that consist of concurrent, two-dimensional wavefronts implemented in a message passing environment. The model combine...
164
click to vote
EPEW
2008
Springer
15 years 8 months ago
2008
Springer
The problem of finding trust paths and estimating the trust one can place in a partner arises in various application areas, including virtual organisations, authentication systems ...
191
click to vote
INFOSCALE
2007
ACM
15 years 8 months ago
2007
ACM
Searching for non-text data (e.g., images) is mostly done by means of metadata annotations or by extracting the text close to the data. However, supporting real content-based audi...