Sciweavers

30 search results - page 3 / 6
» Skip graphs
Sort
View
COMCOM
2008
63views more  COMCOM 2008»
13 years 4 months ago
Range queries over skip tree graphs
Alejandra González Beltrán, Peter Mi...
CCCG
2004
13 years 6 months ago
Local properties of geometric graphs
We propose a definition of locality for properties of geometric graphs. We measure the local density of graphs using region-counting distances [8] between pairs of vertices, and w...
Jean Cardinal, Sébastien Collette, Stefan L...
ICDM
2009
IEEE
181views Data Mining» more  ICDM 2009»
13 years 3 months ago
Efficient Discovery of Frequent Correlated Subgraph Pairs
The recent proliferation of graph data in a wide spectrum of applications has led to an increasing demand for advanced data analysis techniques. In view of this, many graph mining ...
Yiping Ke, James Cheng, Jeffrey Xu Yu
WWW
2010
ACM
14 years 9 days ago
Optimal rare query suggestion with implicit user feedback
Query suggestion has been an effective approach to help users narrow down to the information they need. However, most of existing studies focused on only popular/head queries. Si...
Yang Song, Li-wei He
PODC
2004
ACM
13 years 10 months ago
Load balancing and locality in range-queriable data structures
We describe a load-balancing mechanism for assigning elements to servers in a distributed data structure that supports range queries. The mechanism ensures both load-balancing wit...
James Aspnes, Jonathan Kirsch, Arvind Krishnamurth...