Sciweavers

1321 search results - page 23 / 265
» Quadratic forms on graphs
Sort
View
CCCG
2007
13 years 10 months ago
Pointed Drawings of Planar Graphs
We study the problem how to draw a planar graph such that every vertex is incident to an angle greater than π. In general a straightline embedding cannot guarantee this property....
Oswin Aichholzer, Günter Rote, André S...
IPCO
1993
98views Optimization» more  IPCO 1993»
13 years 10 months ago
A spectral approach to bandwidth and separator problems in graphs
Lower bounds on the bandwidth, the size of a vertex separator of general undirected graphs, and the largest common subgraph of two undirected (weighted) graphs are obtained. The b...
Christoph Helmberg, Bojan Mohar, Svatopluk Poljak,...
PAMI
1998
92views more  PAMI 1998»
13 years 8 months ago
INFORMys: A Flexible Invoice-Like Form-Reader System
—In this paper, we describe a flexible form-reader system capable of extracting textual information from accounting documents, like invoices and bills of service companies. In th...
Francesca Cesarini, Marco Gori, Simone Marinai, Gi...
WWW
2003
ACM
14 years 9 months ago
Extrapolation methods for accelerating PageRank computations
We present a novel algorithm for the fast computation of PageRank, a hyperlink-based estimate of the "importance" of Web pages. The original PageRank algorithm uses the ...
Sepandar D. Kamvar, Taher H. Haveliwala, Christoph...
SAS
1999
Springer
106views Formal Methods» more  SAS 1999»
14 years 1 months ago
Translating Out of Static Single Assignment Form
Programs represented in Static Single Assignment (SSA) form contain phi instructions (or functions) whose operational semantics are to merge values coming from distinct control flo...
Vugranam C. Sreedhar, Roy Dz-Ching Ju, David M. Gi...