Sciweavers

378 search results - page 18 / 76
» How Many Ways Can One Draw a Graph
Sort
View
241
Voted
LACL
2011
Springer
14 years 6 months ago
Using Logic in the Generation of Referring Expressions
The problem of generating referring expressions (GRE) is an important task in natural language generation. In this paper, we advocate for the use of logical languages in the output...
Carlos Areces, Santiago Figueira, Daniel Gor&iacut...
118
Voted
IQ
2007
15 years 5 months ago
A Model For Information Quality Change
: To manage information quality (IQ) effectively, one needs to know how IQ changes over time, what causes it to change, and whether the changes can be predicted. In this paper we a...
Besiki Stvilia
131
Voted
WAW
2009
Springer
136views Algorithms» more  WAW 2009»
15 years 10 months ago
Permuting Web Graphs
Since the first investigations on web graph compression, it has been clear that the ordering of the nodes of the graph has a fundamental influence on the compression rate (usuall...
Paolo Boldi, Massimo Santini, Sebastiano Vigna
139
Voted
GLVLSI
2002
IEEE
109views VLSI» more  GLVLSI 2002»
15 years 8 months ago
Minimizing resources in a repeating schedule for a split-node data-flow graph
Many computation-intensive or recursive applications commonly found in digital signal processing and image processing applications can be represented by data-flow graphs (DFGs). ...
Timothy W. O'Neil, Edwin Hsing-Mean Sha
150
Voted
PAKDD
2011
ACM
209views Data Mining» more  PAKDD 2011»
14 years 6 months ago
Spectral Analysis for Billion-Scale Graphs: Discoveries and Implementation
Abstract. Given a graph with billions of nodes and edges, how can we find patterns and anomalies? Are there nodes that participate in too many or too few triangles? Are there clos...
U. Kang, Brendan Meeder, Christos Faloutsos