Sciweavers

3267 search results - page 201 / 654
» Generalized quasirandom graphs
Sort
View
NIPS
2004
15 years 8 months ago
An Application of Boosting to Graph Classification
This paper presents an application of Boosting for classifying labeled graphs, general structures for modeling a number of real-world data, such as chemical compounds, natural lan...
Taku Kudo, Eisaku Maeda, Yuji Matsumoto
COLING
1996
15 years 8 months ago
Processing Metonymy- a Domain-Model Heuristic Graph Traversal Approach
We address here the treatment of metonymic expressions from a knowledge representation perspective, that is, in the context of a text understanding system which aims to build a co...
Jacques Bouaud, Bruno Bachimont, Pierre Zweigenbau...
SIGIR
2008
ACM
15 years 6 months ago
Re-ranking search results using document-passage graphs
We present a novel passage-based approach to re-ranking documents in an initially retrieved list so as to improve precision at top ranks. While most work on passage-based document...
Michael Bendersky, Oren Kurland
EGH
2009
Springer
15 years 4 months ago
Fast minimum spanning tree for large graphs on the GPU
Graphics Processor Units are used for many general purpose processing due to high compute power available on them. Regular, data-parallel algorithms map well to the SIMD architect...
Vibhav Vineet, Pawan Harish, Suryakant Patidar, P....
FAST
2009
15 years 4 months ago
Application of Named Graphs Towards Custom Provenance Views
Provenance capture as applied to execution oriented and interactive workflows is designed to record minute detail needed to support a "modify and restart" paradigm as we...
Tara Gibson, Karen Schuchardt, Eric G. Stephan