Sciweavers

1282 search results - page 200 / 257
» Algorithms for Large, Sparse Network Alignment Problems
Sort
View
117
Voted
ICNP
2005
IEEE
15 years 8 months ago
Landmark Guided Forwarding
In this paper we focus on the problems of maintaining Ad Hoc network connectivity in the presence of node mobility whilst providing globally efficient and robust routing. The com...
Menghow Lim, Adam Chesterfield, Jon Crowcroft, Jul...
104
Voted
SIGMETRICS
2004
ACM
115views Hardware» more  SIGMETRICS 2004»
15 years 8 months ago
Emulating low-priority transport at the application layer: a background transfer service
Low priority data transfer across the wide area is useful in several contexts, for example for the dissemination of large files such as OS updates, content distribution or prefet...
Peter B. Key, Laurent Massoulié, Bing Wang
121
Voted
IMC
2003
ACM
15 years 7 months ago
Virtual landmarks for the internet
Internet coordinate schemes have been proposed as a method for estimating minimum round trip time between hosts without direct measurement. In such a scheme, each host is assigned...
Liying Tang, Mark Crovella
120
Voted
VLDB
1995
ACM
181views Database» more  VLDB 1995»
15 years 6 months ago
NeuroRule: A Connectionist Approach to Data Mining
Classification, which involves finding rules that partition a given da.ta set into disjoint groups, is one class of data mining problems. Approaches proposed so far for mining cla...
Hongjun Lu, Rudy Setiono, Huan Liu
AAAI
2012
13 years 5 months ago
A Spin-Glass Model for Semi-Supervised Community Detection
Current modularity-based community detection methods show decreased performance as relational networks become increasingly noisy. These methods also yield a large number of divers...
Eric Eaton, Rachael Mansbach