Sciweavers

768 search results - page 64 / 154
» Efficient Correlation Search from Graph Databases
Sort
View
ICDE
2007
IEEE
151views Database» more  ICDE 2007»
16 years 4 months ago
Computing Compressed Multidimensional Skyline Cubes Efficiently
Recently, the skyline computation and analysis have been extended from one single full space to multidimensional subspaces, which can lead to valuable insights in some application...
Jian Pei, Ada Wai-Chee Fu, Xuemin Lin, Haixun Wang
138
Voted
KDD
2009
ACM
228views Data Mining» more  KDD 2009»
16 years 3 months ago
A generalized Co-HITS algorithm and its application to bipartite graphs
Recently many data types arising from data mining and Web search applications can be modeled as bipartite graphs. Examples include queries and URLs in query logs, and authors and ...
Hongbo Deng, Michael R. Lyu, Irwin King
STOC
2010
ACM
228views Algorithms» more  STOC 2010»
15 years 8 months ago
On the searchability of small-world networks with arbitrary underlying structure
Revisiting the “small-world” experiments of the ’60s, Kleinberg observed that individuals are very effective at constructing short chains of acquaintances between any two p...
Pierre Fraigniaud and George Giakkoupis
EDBT
2006
ACM
174views Database» more  EDBT 2006»
16 years 3 months ago
Fast Computation of Reachability Labeling for Large Graphs
The need of processing graph reachability queries stems from many applications that manage complex data as graphs. The applications include transportation network, Internet traffic...
Jiefeng Cheng, Jeffrey Xu Yu, Xuemin Lin, Haixun W...
CORR
2010
Springer
82views Education» more  CORR 2010»
15 years 3 months ago
Expansion and Search in Networks
Borrowing from concepts in expander graphs, we study the expansion properties of real-world, complex networks (e.g. social networks, unstructured peer-to-peer or P2P networks) and...
Arun S. Maiya, Tanya Y. Berger-Wolf