Sciweavers

1078 search results - page 196 / 216
» Networks with Small Stretch Number
Sort
View
IMC
2007
ACM
13 years 10 months ago
Acyclic type-of-relationship problems on the internet: an experimental analysis
An experimental study of the feasibility and accuracy of the acyclicity approach introduced in [14] for the inference of business relationships among autonomous systems (ASes) is ...
Benjamin Hummel, Sven Kosub
COMAD
2009
13 years 9 months ago
Large Maximal Cliques Enumeration in Large Sparse Graphs
Identifying communities in social networks is a problem of great interest. One popular type of community is where every member of the community knows all others, which can be view...
Natwar Modani, Kuntal Dey
CORR
2010
Springer
184views Education» more  CORR 2010»
13 years 8 months ago
Strong Secrecy and Reliable Byzantine Detection in the Presence of an Untrusted Relay
We consider a Gaussian two-hop network where the source and the destination can communicate only via a relay node who is both an eavesdropper and a Byzantine adversary. Both the s...
Xiang He, Aylin Yener
PODC
2004
ACM
14 years 1 months ago
Analyzing Kleinberg's (and other) small-world Models
We analyze the properties of Small-World networks, where links are much more likely to connect “neighbor nodes” than distant nodes. In particular, our analysis provides new re...
Charles U. Martel, Van Nguyen
VLDB
2004
ACM
112views Database» more  VLDB 2004»
14 years 8 months ago
Tracking set-expression cardinalities over continuous update streams
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. In i...
Sumit Ganguly, Minos N. Garofalakis, Rajeev Rastog...