Sciweavers

1477 search results - page 89 / 296
» On Graph Problems in a Semi-streaming Model
Sort
View
CSMR
1999
IEEE
15 years 5 months ago
Impact of Function Pointers on the Call Graph
Maintenance activities are made more difficult when pointers are heavily used in source code: the programmer needs to build a mental model of memory locations and of the way they ...
Giuliano Antoniol, F. Calzolari, Paolo Tonella
CP
2007
Springer
15 years 7 months ago
Scheduling Conditional Task Graphs
The increasing levels of system integration in Multi-Processor System-on-Chips (MPSoCs) emphasize the need for new design flows for efficient mapping of multi-task applications o...
Michele Lombardi, Michela Milano
CVPR
2010
IEEE
15 years 9 months ago
Dense Non-rigid Surface Registration Using High-Order Graph Matching
In this paper, we propose a high-order graph matching formulation to address non-rigid surface matching. The singleton terms capture the geometric and appearance similarities (e.g...
Yun Zeng, Chaohui Wang, Yang Wang, Xianfeng Gu, Di...
MICRO
2006
IEEE
132views Hardware» more  MICRO 2006»
15 years 7 months ago
Data-Dependency Graph Transformations for Superblock Scheduling
The superblock is a scheduling region which exposes instruction level parallelism beyond the basic block through speculative execution of instructions. In general, scheduling supe...
Mark Heffernan, Kent D. Wilken, Ghassan Shobaki
TSE
2010
148views more  TSE 2010»
14 years 12 months ago
Program Behavior Discovery and Verification: A Graph Grammar Approach
—Discovering program behaviors and functionalities can ease program comprehension and verification. Existing program analysis approaches have used text mining algorithms to infer...
Chunying Zhao, Jun Kong, Kang Zhang