Sciweavers

1805 search results - page 91 / 361
» Functional programming with structured graphs
Sort
View
ICALP
2011
Springer
13 years 2 months ago
Clique Clustering Yields a PTAS for max-Coloring Interval Graphs
We are given an interval graph G = (V, E) where each interval I ∈ V has a weight wI ∈ R+. The goal is to color the intervals V with an arbitrary number of color classes C1, C2...
Tim Nonner
VLC
2002
93views more  VLC 2002»
13 years 10 months ago
Metrics for Graph Drawing Aesthetics
Graph layout algorithms typically conform to one or more aesthetic criteria (e.g. minimising the number of bends, maximising orthogonality). Determining the extent to which a grap...
Helen C. Purchase
PLDI
2005
ACM
14 years 4 months ago
Automatic pool allocation: improving performance by controlling data structure layout in the heap
This paper describes Automatic Pool Allocation, a transformation framework that segregates distinct instances of heap-based data structures into seperate memory pools and allows h...
Chris Lattner, Vikram S. Adve
UAI
2004
14 years 4 days ago
Convolutional Factor Graphs as Probabilistic Models
Based on a recent development in the area of error control coding, we introduce the notion of convolutional factor graphs (CFGs) as a new class of probabilistic graphical models. ...
Yongyi Mao, Frank R. Kschischang, Brendan J. Frey
APPINF
2003
14 years 5 days ago
An XML Viewer for Tabular Forms for Use with Mechanical Documentation
We deal with mechanical documentation in software development tools. First, we review tabular forms for program specification and their formal syntax by an attribute edNCE graph ...
Omasu Inoue, Kensei Tsuchida, Shin-ichi Nakagawa, ...