Sciweavers

1002 search results - page 70 / 201
» Towards Graph Programs for Graph Algorithms
Sort
View
JGAA
2000
85views more  JGAA 2000»
15 years 2 months ago
Techniques for the Refinement of Orthogonal Graph Drawings
Current orthogonal graph drawing algorithms produce drawings which are generally good. However, many times the quality of orthogonal drawings can be significantly improved with a ...
Janet M. Six, Konstantinos G. Kakoulis, Ioannis G....
SCAM
2002
IEEE
15 years 7 months ago
Precise Call Graph Construction in the Presence of Function Pointers
The use of pointers presents serious problems for software productivity tools for software understanding, restructuring, and testing. Pointers enable indirect memory accesses thro...
Ana Milanova, Atanas Rountev, Barbara G. Ryder
POPL
1993
ACM
15 years 6 months ago
Graph Types
e data structures are abstractions of simple records and pointers. They impose a shape invariant, which is verified at compiletime and exploited to automatically generate code fo...
Nils Klarlund, Michael I. Schwartzbach
TCBB
2010
144views more  TCBB 2010»
14 years 9 months ago
Querying Graphs in Protein-Protein Interactions Networks Using Feedback Vertex Set
Recent techniques increase rapidly the amount of our knowledge on interactions between proteins. The interpretation of these new information depends on our ability to retrieve kno...
Guillaume Blin, Florian Sikora, Stéphane Vi...
JMLR
2006
124views more  JMLR 2006»
15 years 2 months ago
Fast SDP Relaxations of Graph Cut Clustering, Transduction, and Other Combinatorial Problem
The rise of convex programming has changed the face of many research fields in recent years, machine learning being one of the ones that benefitted the most. A very recent develop...
Tijl De Bie, Nello Cristianini