Sciweavers

767 search results - page 112 / 154
» On Clustering Using Random Walks
Sort
View
CCS
2010
ACM
13 years 6 months ago
Designs to account for trust in social network-based sybil defenses
Social network-based Sybil defenses exploit the trust exhibited in social graphs to detect Sybil nodes that disrupt an algorithmic property (i.e., the fast mixing) in these graphs...
Abedelaziz Mohaisen, Nicholas Hopper, Yongdae Kim
TIP
2010
176views more  TIP 2010»
13 years 2 months ago
A PDE Formalization of Retinex Theory
In 1964 Edwin H. Land formulated the Retinex theory, the first attempt to simulate and explain how the human visual system perceives color. His theory and an extension, the "r...
Jean-Michel Morel, Ana Belen Petro, Catalina Sbert
TMM
2010
249views Management» more  TMM 2010»
13 years 2 months ago
Bridging the Semantic Gap Between Image Contents and Tags
With the exponential growth of Web 2.0 applications, tags have been used extensively to describe the image contents on the Web. Due to the noisy and sparse nature in the human gene...
Hao Ma, Jianke Zhu, Michael R. Lyu, Irwin King
KDD
2008
ACM
193views Data Mining» more  KDD 2008»
14 years 8 months ago
A family of dissimilarity measures between nodes generalizing both the shortest-path and the commute-time distances
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...
Luh Yen, Marco Saerens, Amin Mantrach, Masashi Shi...
PERCOM
2007
ACM
14 years 7 months ago
Fundamental Mobility Properties for Realistic Performance Analysis of Intermittently Connected Mobile Networks
Traditional mobile ad hoc routing protocols fail to deliver any data in Intermittently Connected Mobile Ad Hoc Networks (ICMN's) because of the absence of complete end-to-end ...
Apoorva Jindal, Konstantinos Psounis