1282 search results - page 148 / 257 » Algorithms for Large, Sparse Network Alignment Problems |
181
Voted
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Predicting the occurrence of links is a fundamental problem in networks. In the link prediction problem we are given a snapshot of a network and would like to infer which interact...
154
click to vote
SPAA
2006
ACM
15 years 10 months ago
2006
ACM
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...
146
click to vote
CIKM
2005
Springer
15 years 6 months ago
2005
Springer
We consider the general problem of tracking moving objects in sensor networks. The specific application we consider is that of tracking a chemical plume moving over a large infra...
143
click to vote
ASPDAC
2007
ACM
15 years 8 months ago
2007
ACM
- This paper proposes a fast and practical decoupling capacitor (decap) budgeting algorithm to optimize the power ground (P/G) network design. The new method adopts a modified rand...
160
Voted
ISPASS
2006
IEEE
15 years 10 months ago
2006
IEEE
Applications in Computer Networks often require high throughput access to large data structures for lookup and classification. Many advanced algorithms exist to speed these searc...