17541 search results - page 401 / 3509 » Complexity in scalable computing |
132
Voted
STACS
2010
Springer
15 years 9 months ago
2010
Springer
We completely characterise the computational complexity of the list homomorphism problem for graphs in combinatorial and algebraic terms: for every graph H the problem is either N...
145
click to vote
WWW
2007
ACM
16 years 5 months ago
2007
ACM
Generic database replication algorithms do not scale linearly in throughput as all update, deletion and insertion (UDI) queries must be applied to every database replica. The thro...
149
click to vote
WWW
2004
ACM
16 years 5 months ago
2004
ACM
The ability to accurately identify the network traffic associated with different P2P applications is important to a broad range of network operations including application-specifi...
147
click to vote
SDM
2009
SIAM
16 years 2 months ago
2009
SIAM
This paper considers the problem of change detection using local distributed eigen monitoring algorithms for next generation of astronomy petascale data pipelines such as the Larg...
142
click to vote
ICNP
2009
IEEE
15 years 11 months ago
2009
IEEE
—Recently, there has been much renewed interest in developing compact data structures for packet processing functions such as longest prefix-match for IP lookups. This has been ...