Sciweavers

376 search results - page 60 / 76
» Completely connected clustered graphs
Sort
View
DM
2008
73views more  DM 2008»
13 years 7 months ago
A note on edge-graceful spectra of the square of paths
For a simple path Pr on r vertices, the square of Pr is the graph P2 r on the same set of vertices of Pr , and where every pair of vertices of distance two or less in Pr is connec...
Tao-Ming Wang, Cheng-Chih Hsiao, Sin-Min Lee
PODC
2009
ACM
14 years 8 months ago
Brief announcement: global consistency can be easier than point-to-point communication
Global consistency or Byzantine Agreement (BA) and reliable point-to-point communication are two of the most important and well-studied problems in distributed computing. Informal...
Prasant Gopal, Anuj Gupta, Pranav K. Vasishta, Piy...
COMSWARE
2006
IEEE
14 years 1 months ago
Resource management in heterogenous wireless networks with overlapping coverage
— Development in new radio technologies and increase in user demands are driving the deployment of a wide array of wireless networks, ranging from 802.11 networks in the local ar...
Bin Bin Chen, Mun Choon Chan
KDD
2009
ACM
152views Data Mining» more  KDD 2009»
14 years 8 months ago
TANGENT: a novel, 'Surprise me', recommendation algorithm
Most of recommender systems try to find items that are most relevant to the older choices of a given user. Here we focus on the "surprise me" query: A user may be bored ...
Kensuke Onuma, Hanghang Tong, Christos Faloutsos
CORR
2004
Springer
119views Education» more  CORR 2004»
13 years 7 months ago
Exploring networks with traceroute-like probes: theory and simulations
Mapping the Internet generally consists in sampling the network from a limited set of sources by using traceroute-like probes. This methodology, akin to the merging of different s...
Luca Dall'Asta, J. Ignacio Alvarez-Hamelin, Alain ...