Sciweavers

45 search results - page 5 / 9
» Storage Capacity of Labeled Graphs
Sort
View
SIGIR
2008
ACM
13 years 7 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
2010
ACM
247views Data Mining» more  KDD 2010»
13 years 9 months ago
Metric forensics: a multi-level approach for mining volatile graphs
Advances in data collection and storage capacity have made it increasingly possible to collect highly volatile graph data for analysis. Existing graph analysis techniques are not ...
Keith Henderson, Tina Eliassi-Rad, Christos Falout...
CIVR
2008
Springer
106views Image Analysis» more  CIVR 2008»
13 years 9 months ago
Scalable Markov model-based image annotation
In this paper, we propose a novel Markov model-based formulation for the image annotation problem. In this formulation, we treat image annotation as a graph ranking problem, by de...
Changhu Wang, Lei Zhang, Hong-Jiang Zhang
ICCAD
2001
IEEE
126views Hardware» more  ICCAD 2001»
14 years 4 months ago
Constraint Satisfaction for Relative Location Assignment and Scheduling
Tight data- and timing constraints are imposed by communication and multimedia applications. The architecture for the embedded processor imply resource constraints. Instead of ran...
Carlos A. Alba Pinto, Bart Mesman, Jochen A. G. Je...
ESWS
2010
Springer
14 years 8 days ago
Replication and Versioning of Partial RDF Graphs
The sizes of datasets available as RDF (e.g., as part of the Linked Data cloud) are increasing continuously. For instance, the recent DBpedia version consists of nearly 500 million...
Bernhard Schandl