Sciweavers

3708 search results - page 531 / 742
» Approximating Betweenness Centrality
Sort
View
INFOCOM
2010
IEEE
15 years 5 months ago
Know Thy Neighbor: Towards Optimal Mapping of Contacts to Social Graphs for DTN Routing
—Delay Tolerant Networks (DTN) are networks of self-organizing wireless nodes, where end-to-end connectivity is intermittent. In these networks, forwarding decisions are generall...
Theus Hossmann, Thrasyvoulos Spyropoulos, Franck L...
JCS
2010
104views more  JCS 2010»
15 years 5 months ago
Finding the PKI needles in the Internet haystack
Public-key cryptography can uniquely enable trust within distributed settings. Employing it usually requires deploying a set of tools and services collectively known as a public k...
Massimiliano Pala, Sean W. Smith
MM
2010
ACM
402views Multimedia» more  MM 2010»
15 years 5 months ago
Discriminative codeword selection for image representation
Bag of features (BoF) representation has attracted an increasing amount of attention in large scale image processing systems. BoF representation treats images as loose collections...
Lijun Zhang 0005, Chun Chen, Jiajun Bu, Zhengguang...
RSA
2010
94views more  RSA 2010»
15 years 5 months ago
Word maps and spectra of random graph lifts
We study here the spectra of random lifts of graphs. Let G be a finite connected graph, and let the infinite tree T be its universal cover space. If λ1 and ρ are the spectral ...
Nati Linial, Doron Puder
SYNTHESE
2010
99views more  SYNTHESE 2010»
15 years 5 months ago
Vagueness, uncertainty and degrees of clarity
The focus of the paper is on the logic of clarity and the problem of higherorder vagueness. We first examine the consequences of the notion of intransitivity of indiscriminabilit...
Paul Égré, Denis Bonnay