713 search results - page 70 / 143 » Saving Space by Algebraization |
145
click to vote
ICDM
2006
IEEE
15 years 6 months ago
2006
IEEE
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...
101
click to vote
ASPDAC
2006
ACM
15 years 6 months ago
2006
ACM
– Modern multi-processor system-on-chip (MPSoC) designs have high bandwidth constraints which must be satisfied by the underlying communication architecture. Bus matrix based com...
ATAL
2005
Springer
15 years 6 months ago
2005
Springer
A peer-to-peer(P2P) system comprises a network of nodes that are capable of sharing and exchanging resources with one another. Recent studies of P2P networks show that many resour...
96
Voted
CDB
2004
Springer
15 years 6 months ago
2004
Springer
Constraint Processing and Database techniques overlap significantly. We discuss here the application of a constraint satisfaction technique, called dynamic bundling, to databases....
101
click to vote
SIGIR
1999
ACM
15 years 4 months ago
1999
ACM
We present three distributed algorithms to build global inverted files for very large text collections. The distributed environment we use is a high bandwidth network of workstati...