2996 search results - page 296 / 600 » Numberings and Randomness |
204
click to vote
INFOCOM
2007
IEEE
16 years 1 months ago
2007
IEEE
— The need for efficient counter architecture has arisen for the following two reasons. Firstly, a number of data streaming algorithms and network management applications requir...
196
click to vote
WAW
2007
Springer
16 years 25 days ago
2007
Springer
Betweenness is a centrality measure based on shortest paths, widely used in complex network analysis. It is computationally-expensive to exactly determine betweenness; currently th...
165
click to vote
APPROX
2005
Springer
16 years 8 days ago
2005
Springer
A string α ∈ Σn is called p-periodic, if for every i, j ∈ {1, . . . , n}, such that i ≡ j mod p, αi = αj, where αi is the i-th place of α. A string α ∈ Σn is said t...
174
click to vote
STACS
2005
Springer
16 years 6 days ago
2005
Springer
The subset sum problem (SSP) (given n numbers and a target bound B, find a subset of the numbers summing to B), is one of the classical NP-hard problems. The hardness of SSP vari...
174
click to vote
GC
2004
Springer
16 years 3 days ago
2004
Springer
Abstract. Is it possible to treat large scale distributed systems as physical systems? The importance of that question stems from the fact that the behavior of many P2P systems is ...