2262 search results - page 69 / 453 » Challenging Applications on Fast Networks |
160
click to vote
CIKM
2010
Springer
15 years 3 months ago
2010
Springer
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
146
click to vote
LCTRTS
2010
Springer
15 years 11 months ago
2010
Springer
With increasingly more complex Multi-Processor Systems on Chip (MPSoC) and shortening time-to- market projections, Transaction Level Modeling and Platform Aware Design are seen as...
130
click to vote
GLOBECOM
2008
IEEE
15 years 10 months ago
2008
IEEE
Abstract—Network applications often require large data storage resources, fast queries, and frequent updates. Hash tables support these operations with low costs, yet they cannot...
159
click to vote
PODC
2009
ACM
16 years 4 months ago
2009
ACM
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...
153
click to vote
ICMCS
2009
IEEE
15 years 2 months ago
2009
IEEE
Video adaptation has been considered as a promising technique to tackle challenging problems in pervasive multimedia applications. However, the styles of video representation and ...