Sciweavers

1542 search results - page 157 / 309
» The metamathematics of random graphs
Sort
View
WWW
2010
ACM
15 years 2 months ago
LINKREC: a unified framework for link recommendation with user attributes and graph structure
With the phenomenal success of networking sites (e.g., Facebook, Twitter and LinkedIn), social networks have drawn substantial attention. On online social networking sites, link r...
Zhijun Yin, Manish Gupta, Tim Weninger, Jiawei Han
WG
1993
Springer
15 years 6 months ago
Graphs, Hypergraphs and Hashing
Minimal perfect hash functions are used for memory efficient storage and fast retrieval of items from static sets. We present an infinite family of efficient and practical algori...
George Havas, Bohdan S. Majewski, Nicholas C. Worm...
IJCV
2008
281views more  IJCV 2008»
15 years 1 months ago
Simultaneous Segmentation and Pose Estimation of Humans Using Dynamic Graph Cuts
Abstract This paper presents a novel algorithm for performing integrated segmentation and 3D pose estimation of a human body from multiple views. Unlike other state of the art meth...
Pushmeet Kohli, Jonathan Rihan, Matthieu Bray, Phi...
PAMI
2006
141views more  PAMI 2006»
15 years 1 months ago
Diffusion Maps and Coarse-Graining: A Unified Framework for Dimensionality Reduction, Graph Partitioning, and Data Set Parameter
We provide evidence that non-linear dimensionality reduction, clustering and data set parameterization can be solved within one and the same framework. The main idea is to define ...
Stéphane Lafon, Ann B. Lee
INFOCOM
2009
IEEE
15 years 8 months ago
Exact Analysis of Latency of Stateless Opportunistic Forwarding
Abstract—Stateless opportunistic forwarding is a simple faulttolerant distributed approach for data delivery and information querying in wireless ad hoc networks, where packets a...
Chi-Kin Chau, Prithwish Basu