Sciweavers

492 search results - page 21 / 99
» XML graphs in program analysis
Sort
View
PPOPP
2010
ACM
14 years 7 months ago
A distributed placement service for graph-structured and tree-structured data
Effective data placement strategies can enhance the performance of data-intensive applications implemented on high end computing clusters. Such strategies can have a significant i...
Gregory Buehrer, Srinivasan Parthasarathy, Shirish...
CC
2008
Springer
172views System Software» more  CC 2008»
13 years 11 months ago
Efficient Context-Sensitive Shape Analysis with Graph Based Heap Models
The performance of heap analysis techniques has a significant impact on their utility in an optimizing compiler. Most shape analysis techniques perform interprocedural dataflow ana...
Mark Marron, Manuel V. Hermenegildo, Deepak Kapur,...
ICPR
2008
IEEE
14 years 4 months ago
A symbol graph based handwritten math expression recognition
In online handwritten math expression recognition, one-pass dynamic programming can produce highquality symbol graphs in addition to best symbol sequence hypotheses [3], especiall...
Yu Shi, Frank K. Soong
KDD
2005
ACM
162views Data Mining» more  KDD 2005»
14 years 10 months ago
Discovering frequent topological structures from graph datasets
The problem of finding frequent patterns from graph-based datasets is an important one that finds applications in drug discovery, protein structure analysis, XML querying, and soc...
Ruoming Jin, Chao Wang, Dmitrii Polshakov, Sriniva...
IPPS
2010
IEEE
13 years 7 months ago
Executing task graphs using work-stealing
Abstract--NABBIT is a work-stealing library for execution of task graphs with arbitrary dependencies which is implemented as a library for the multithreaded programming language Ci...
Kunal Agrawal, Charles E. Leiserson, Jim Sukha