Sciweavers

2304 search results - page 250 / 461
» On the Vulnerability of Large Graphs
Sort
View
CIKM
2008
Springer
15 years 8 months ago
Modeling multi-step relevance propagation for expert finding
An expert finding system allows a user to type a simple text query and retrieve names and contact information of individuals that possess the expertise expressed in the query. Thi...
Pavel Serdyukov, Henning Rode, Djoerd Hiemstra
SDM
2010
SIAM
182views Data Mining» more  SDM 2010»
15 years 8 months ago
HCDF: A Hybrid Community Discovery Framework
We introduce a novel Bayesian framework for hybrid community discovery in graphs. Our framework, HCDF (short for Hybrid Community Discovery Framework), can effectively incorporate...
Keith Henderson, Tina Eliassi-Rad, Spiros Papadimi...
IS
2007
15 years 6 months ago
Discovering frequent geometric subgraphs
As data mining techniques are being increasingly applied to non-traditional domains, existing approaches for finding frequent itemsets cannot be used as they cannot model the req...
Michihiro Kuramochi, George Karypis
CGF
1999
125views more  CGF 1999»
15 years 6 months ago
Partitioning and Handling Massive Models for Interactive Collision Detection
We describe an approach for interactive collision detection and proximity computations on massive models composed of millions of geometric primitives. We address issues related to...
Andy Wilson, Eric Larsen, Dinesh Manocha, Ming C. ...
PAMI
2010
324views more  PAMI 2010»
15 years 5 months ago
A Compositional and Dynamic Model for Face Aging
—In this paper we present a compositional and dynamic model for face aging. The compositional model represents faces in each age group by a hierarchical And-Or graph, in which An...
Jin-Li Suo, Song Chun Zhu, Shiguang Shan, Xilin Ch...