Sciweavers

18 search results - page 2 / 4
» Summarization system evaluation revisited: N-gram graphs
Sort
View
SIGMOD
2008
ACM
191views Database» more  SIGMOD 2008»
14 years 7 months ago
Efficient aggregation for graph summarization
Graphs are widely used to model real world objects and their relationships, and large graph datasets are common in many application domains. To understand the underlying character...
Yuanyuan Tian, Richard A. Hankins, Jignesh M. Pate...
LCPC
2005
Springer
14 years 26 days ago
Revisiting Graph Coloring Register Allocation: A Study of the Chaitin-Briggs and Callahan-Koblenz Algorithms
Techniques for global register allocation via graph coloring have been extensively studied and widely implemented in compiler frameworks. This paper examines a particular variant â...
Keith D. Cooper, Anshuman Dasgupta, Jason Eckhardt
SAS
2009
Springer
212views Formal Methods» more  SAS 2009»
14 years 8 months ago
The Causal Graph Revisited for Directed Model Checking
Directed model checking is a well-established technique to tackle the state explosion problem when the aim is to find error states in large systems. In this approach, the state spa...
Martin Wehrle, Malte Helmert
SIGIR
2010
ACM
13 years 11 months ago
The importance of anchor text for ad hoc search revisited
It is generally believed that propagated anchor text is very important for effective Web search as offered by the commercial search engines. “Google Bombs” are a notable illus...
Marijn Koolen, Jaap Kamps
AI
2009
Springer
14 years 2 months ago
Automatic Frame Extraction from Sentences
We present a method for automatic extraction of frames from .a dependency graph. Our method uses machine learning applied to a dependency tree to assign frames and assign frame ele...
Martin Scaiano, Diana Inkpen