1415 search results - page 277 / 283 » Can Parallel Algorithms Enhance Serial Implementation |
CORR
2010
Springer
13 years 6 months ago
2010
Springer
The neighbourhood function NG(t) of a graph G gives, for each t ∈ N, the number of pairs of nodes x, y such that y is reachable from x in less that t hops. The neighbourhood fun...
WWW
2008
ACM
14 years 8 months ago
2008
ACM
Contextual advertising supports much of the Web's ecosystem today. User experience and revenue (shared by the site publisher ad the ad network) depend on the relevance of the...
KBSE
2007
IEEE
14 years 1 months ago
2007
IEEE
Flow composition languages permit the construction of longrunning transactions from collections of independent, atomic services. Due to environmental limitations, such transaction...
CCGRID
2003
IEEE
14 years 27 days ago
2003
IEEE
Abstract— Cycle-harvesting software on commodity computers is available from a number of companies and a significant part of the Grid computing landscape. However, creating comm...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Sphere decoding achieves maximum-likelihood (ML) performance at the cost of exponential complexity; lattice reduction-aided successive interference cancelation (SIC) significantly...