Sciweavers

852 search results - page 66 / 171
» Using graph parsing for automatic graph drawing
Sort
View
ESOP
2010
Springer
15 years 7 months ago
Formal Verification of Coalescing Graph-Coloring Register Allocation
Iterated Register Coalescing (IRC) is a widely used heuristic for performing register allocation via graph coloring. Many implementations in existing compilers follow (more or less...
Andrew W. Appel, Benoît Robillard, Sandrine ...
VLSID
2009
IEEE
182views VLSI» more  VLSID 2009»
15 years 4 months ago
Fuzzy Logic Based Guidance to Graph Grammar Framework for Automated Analog Circuit Design
Abstract— This paper introduces a fuzzy logic based guidance architecture to a graph grammar framework for automated design of analog circuits. The grammar generates circuit topo...
Angan Das, Ranga Vemuri
WWW
2008
ACM
15 years 10 months ago
Web video topic discovery and tracking via bipartite graph reinforcement model
Automatic topic discovery and tracking on web-shared videos can greatly benefit both web service providers and end users. Most of current solutions of topic detection and tracking...
Lu Liu, Lifeng Sun, Yong Rui, Yao Shi, Shiqiang Ya...
HPDC
2007
IEEE
15 years 4 months ago
Feedback-directed thread scheduling with memory considerations
This paper describes a novel approach to generate an optimized schedule to run threads on distributed shared memory (DSM) systems. The approach relies upon a binary instrumentatio...
Fengguang Song, Shirley Moore, Jack Dongarra
IROS
2009
IEEE
147views Robotics» more  IROS 2009»
15 years 4 months ago
A multi-hypothesis topological SLAM approach for loop closing on edge-ordered graphs
— We present a method for topological SLAM that specifically targets loop closing for edge-ordered graphs. Instead of using a heuristic approach to accept or reject loop closing...
Stephen Tully, George Kantor, Howie Choset, Felix ...