Sciweavers

768 search results - page 53 / 154
» Efficient Correlation Search from Graph Databases
Sort
View
FCCM
2009
IEEE
134views VLSI» more  FCCM 2009»
15 years 6 months ago
Efficient Mapping of Hardware Tasks on Reconfigurable Computers Using Libraries of Architecture Variants
Scheduling and partitioning of task graphs on reconfigurable hardware needs to be carefully carried out in order to achieve the best possible performance. In this paper, we demons...
Miaoqing Huang, Vikram K. Narayana, Tarek A. El-Gh...
KDD
2007
ACM
184views Data Mining» more  KDD 2007»
16 years 3 months ago
GraphScope: parameter-free mining of large time-evolving graphs
How can we find communities in dynamic networks of social interactions, such as who calls whom, who emails whom, or who sells to whom? How can we spot discontinuity timepoints in ...
Jimeng Sun, Christos Faloutsos, Spiros Papadimitri...
SIGMOD
2007
ACM
229views Database» more  SIGMOD 2007»
16 years 3 months ago
Spark: top-k keyword query in relational databases
With the increasing amount of text data stored in relational databases, there is a demand for RDBMS to support keyword queries over text data. As a search result is often assemble...
Yi Luo, Xuemin Lin, Wei Wang 0011, Xiaofang Zhou
SIGMOD
2010
ACM
196views Database» more  SIGMOD 2010»
15 years 3 months ago
GAIA: graph classification using evolutionary computation
Discriminative subgraphs are widely used to define the feature space for graph classification in large graph databases. Several scalable approaches have been proposed to mine disc...
Ning Jin, Calvin Young, Wei Wang
VLDB
2002
ACM
138views Database» more  VLDB 2002»
15 years 2 months ago
Adaptable Similarity Search using Non-Relevant Information
Many modern database applications require content-based similarity search capability in numeric attribute space. Further, users' notion of similarity varies between search se...
T. V. Ashwin, Rahul Gupta, Sugata Ghosal