71 search results - page 9 / 15 » Call Graph Prefetching for Database Applications |
175
click to vote
ICDE
2007
IEEE
16 years 29 days ago
2007
IEEE
In many applications it is important to find a meaningful relationship between the schemas of a source and target database. This relationship is expressed in terms of declarative ...
113
click to vote
WWW
2008
ACM
16 years 8 days ago
2008
ACM
Improving the precision of information retrieval has been a challenging issue on Chinese Web. As exemplified by Chinese recipes on the Web, it is not easy/natural for people to us...
105
click to vote
ISSTA
2009
ACM
15 years 6 months ago
2009
ACM
Bug localization has attracted a lot of attention recently. Most existing methods focus on pinpointing a single statement or function call which is very likely to contain bugs. Al...
113
click to vote
KDD
2009
ACM
16 years 4 days ago
2009
ACM
Classifying nodes in networks is a task with a wide range of applications. It can be particularly useful in anomaly and fraud detection. Many resources are invested in the task of...
EDBT
2009
ACM
15 years 6 months ago
2009
ACM
To our best knowledge, all existing graph pattern mining algorithms can only mine either closed, maximal or the complete set of frequent subgraphs instead of graph generators whic...