98 search results - page 11 / 20 » Finding Regular Simple Paths in Graph Databases |
WWW
2007
ACM
14 years 8 months ago
2007
ACM
![Finding community structure in mega-scale social networks: [extended abstract]](https://www.sciweavers.org/files/imagecache/thumbnail/default/content.jpg "Finding community structure in mega-scale social networks: [extended abstract]")
[Extended Abstract] Ken Wakita Tokyo Institute of Technology 2-12-1 Ookayama, Meguro-ku Tokyo 152-8552, Japan wakita@is.titech.ac.jp Toshiyuki Tsurumi Tokyo Institute of Technolog...
VLDB
1998
ACM
13 years 11 months ago
1998
ACM
An information retrieval IR engine can rank documents based on textual proximityof keywords within each document. In this paper we apply this notion to search across an entire dat...
ICDE
2002
IEEE
14 years 8 months ago
2002
IEEE
With the growth of the Web, there has been a rapid increase in the number of users who need to access online databases without having a detailed knowledge of the schema or of quer...
DATAMINE
2000
13 years 7 months ago
2000
Abstract: Spatial data mining algorithms heavily depend on the efficient processing of neighborhood relations since the neighbors of many objects have to be investigated in a singl...
JMLR
2012
11 years 10 months ago
2012
We consider the sparse inverse covariance regularization problem or graphical lasso with regularization parameter λ. Suppose the sample covariance graph formed by thresholding th...