Sciweavers

966 search results - page 166 / 194
» Small Alliances in Graphs
Sort
View
WAW
2010
Springer
270views Algorithms» more  WAW 2010»
13 years 6 months ago
Fast Katz and Commuters: Efficient Estimation of Social Relatedness in Large Networks
Abstract. Motivated by social network data mining problems such as link prediction and collaborative filtering, significant research effort has been devoted to computing topologica...
Pooya Esfandiar, Francesco Bonchi, David F. Gleich...
IEEECGIV
2009
IEEE
13 years 6 months ago
A Zoomable Shopping Browser Using a Graphic-Treemap
Effective and efficient navigation and representation of the entire structure of the product catalogue is one of the important factors for on-line market. This paper proposes an a...
Mao Lin Huang, Quang Vinh Nguyen, Viet Cuong Vo, J...
CPC
2010
117views more  CPC 2010»
13 years 6 months ago
On the Number of Perfect Matchings in Random Lifts
Let G be a fixed connected multigraph with no loops. A random n-lift of G is obtained by replacing each vertex of G by a set of n vertices (where these sets are pairwise disjoint)...
Catherine S. Greenhill, Svante Janson, Andrzej Ruc...
CVPR
2011
IEEE
13 years 5 months ago
Adequate Reconstruction of Transparent Objects on a Shoestring Budget
Reconstructing transparent objects is a challenging problem. While producing reasonable results for quite complex objects, existing approaches require custom calibration or somewh...
Sai-Kit Yeung, Tai-Pang Wu, Chi-keung Tang, Tony F...
ACCV
2010
Springer
13 years 3 months ago
Earth Mover's Morphing: Topology-Free Shape Morphing Using Cluster-Based EMD Flows
Abstract. This paper describes a method for topology-free shape morphing based on region cluster-based Earth Mover's Distance (EMD) flows, since existing methods for closed cu...
Yasushi Makihara, Yasushi Yagi