Sciweavers

2270 search results - page 224 / 454
» On the distribution of eigenvalues of graphs
Sort
View
SIGIR
2008
ACM
15 years 6 months ago
Learning query intent from regularized click graphs
This work presents the use of click graphs in improving query intent classifiers, which are critical if vertical search and general-purpose search services are to be offered in a ...
Xiao Li, Ye-Yi Wang, Alex Acero
KDD
2009
ACM
163views Data Mining» more  KDD 2009»
16 years 7 months ago
Large-scale graph mining using backbone refinement classes
We present a new approach to large-scale graph mining based on so-called backbone refinement classes. The method efficiently mines tree-shaped subgraph descriptors under minimum f...
Andreas Maunz, Christoph Helma, Stefan Kramer
ISSTA
2009
ACM
16 years 1 months ago
Identifying bug signatures using discriminative graph mining
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...
Hong Cheng, David Lo, Yang Zhou, Xiaoyin Wang, Xif...
INFOCOM
2007
IEEE
16 years 26 days ago
Separability and Topology Control of Quasi Unit Disk Graphs
— A deep understanding of the structural properties of wireless networks is critical for evaluating the performance of network protocols and improving their designs. Many protoco...
Jianer Chen, Anxiao Jiang, Iyad A. Kanj, Ge Xia, F...
ESWS
2007
Springer
16 years 22 days ago
A Performance and Scalability Metric for Virtual RDF Graphs
Abstract. From a theoretical point of view, the Semantic Web is understood in terms of a stack with RDF being one of its layers. A Semantic Web application operates on the common d...
Michael Hausenblas, Wolfgang Slany, Danny Ayers