Sciweavers

7941 search results - page 1483 / 1589
» Network Analysis of Repositories
Sort
View
INFOCOM
2012
IEEE
13 years 8 months ago
On superposition of heterogeneous edge processes in dynamic random graphs
—This paper builds a generic modeling framework for analyzing the edge-creation process in dynamic random graphs in which nodes continuously alternate between active and inactive...
Zhongmei Yao, Daren B. H. Cline, Dmitri Loguinov
CSFW
2012
IEEE
13 years 8 months ago
Generic Indifferentiability Proofs of Hash Designs
—In this paper, we propose a formal analysis of domain extenders for hash functions in the indifferentiability framework. We define a general model for domain extenders and prov...
Marion Daubignard, Pierre-Alain Fouque, Yassine La...
CVPR
2012
IEEE
13 years 8 months ago
Urban tribes: Analyzing group photos from a social perspective
The explosive growth in image sharing via social networks has produced exciting opportunities for the computer vision community in areas including face, text, product and scene re...
Ana C. Murillo, Iljung S. Kwak, Lubomir Bourdev, D...
TMC
2012
13 years 8 months ago
Trajectory-Based Statistical Forwarding for Multihop Infrastructure-to-Vehicle Data Delivery
—This paper proposes Trajectory-based Statistical Forwarding (TSF) scheme, tailored for the multihop data delivery from infrastructure nodes (e.g., Internet access points) to mov...
Jaehoon (Paul) Jeong, Shuo Guo, Yu (Jason) Gu, Tia...
EDBT
2012
ACM
228views Database» more  EDBT 2012»
13 years 8 months ago
Finding maximal k-edge-connected subgraphs from a large graph
In this paper, we study how to find maximal k-edge-connected subgraphs from a large graph. k-edge-connected subgraphs can be used to capture closely related vertices, and findin...
Rui Zhou, Chengfei Liu, Jeffrey Xu Yu, Weifa Liang...
« Prev « First page 1483 / 1589 Last » Next »