Sciweavers

127 search results - page 24 / 26
» Mode Directed Path Finding
Sort
View
PRL
2010
158views more  PRL 2010»
13 years 5 months ago
Data clustering: 50 years beyond K-means
: Organizing data into sensible groupings is one of the most fundamental modes of understanding and learning. As an example, a common scheme of scientific classification puts organ...
Anil K. Jain
SODA
1998
ACM
157views Algorithms» more  SODA 1998»
13 years 8 months ago
A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
Bang Ye Wu, Giuseppe Lancia, Vineet Bafna, Kun-Mao...
NSDI
2008
13 years 9 months ago
Studying Black Holes in the Internet with Hubble
We present Hubble, a system that operates continuously to find Internet reachability problems in which routes exist to a destination but packets are unable to reach the destinatio...
Ethan Katz-Bassett, Harsha V. Madhyastha, John P. ...
IDA
2009
Springer
13 years 4 months ago
Mining the Temporal Dimension of the Information Propagation
In the last decade, Social Network Analysis has been a field in which the effort devoted from several researchers in the Data Mining area has increased very fast. Among the possibl...
Michele Berlingerio, Michele Coscia, Fosca Giannot...
IWCMC
2006
ACM
14 years 28 days ago
TARP: trust-aware routing protocol
Security is a critical issue in a mobile ad hoc network (MANET). In most of the previous protocols security is an added layer above the routing protocol. We propose a TrustAware R...
Loay Abusalah, Ashfaq A. Khokhar, G. BenBrahim, W....