Sciweavers

2463 search results - page 168 / 493
» Rankings of Directed Graphs
Sort
View
KDD
2007
ACM
144views Data Mining» more  KDD 2007»
14 years 10 months ago
Fast direction-aware proximity for graph mining
In this paper we study asymmetric proximity measures on directed graphs, which quantify the relationships between two nodes or two groups of nodes. The measures are useful in seve...
Hanghang Tong, Christos Faloutsos, Yehuda Koren
CVPR
2005
IEEE
14 years 11 months ago
Dense Photometric Stereo Using a Mirror Sphere and Graph Cut
We present a surprisingly simple system that allows for robust normal reconstruction by dense photometric stereo, in the presence of severe shadows, highlight, transparencies, com...
Tai-Pang Wu, Chi-Keung Tang
KDD
2009
ACM
169views Data Mining» more  KDD 2009»
14 years 10 months ago
COA: finding novel patents through text analysis
In recent years, the number of patents filed by the business enterprises in the technology industry are growing rapidly, thus providing unprecedented opportunities for knowledge d...
Mohammad Al Hasan, W. Scott Spangler, Thomas D. Gr...
SIGMOD
2004
ACM
163views Database» more  SIGMOD 2004»
14 years 9 months ago
Rank-aware Query Optimization
Ranking is an important property that needs to be fully supported by current relational query engines. Recently, several rank-join query operators have been proposed based on rank...
Ihab F. Ilyas, Rahul Shah, Walid G. Aref, Jeffrey ...
EMMCVPR
2005
Springer
14 years 3 months ago
Retrieving Articulated 3-D Models Using Medial Surfaces and Their Graph Spectra
We consider the use of medial surfaces to represent symmetries of cts. This allows for a qualitative abstraction based on a directed acyclic graph of components and also a degree o...
Juan Zhang, Kaleem Siddiqi, Diego Macrini, Ali Sho...