417 search results - page 9 / 84 » Constructing Call Multigraphs Using Dependence Graphs |
ALGORITHMICA
2010
14 years 11 months ago
2010
We present the first dynamic graph algorithm for recognizing interval graphs. The algorithm runs in O(n log n) worst-case time per edge deletion or edge insertion, where n is the ...
96
Voted
TKDE
2008
14 years 11 months ago
2008
Schema matching is one of the key challenges in information integration. It is a labor-intensive and time-consuming process. To alleviate the problem, many automated solutions have...
99
Voted
IWOMP
2007
Springer
15 years 5 months ago
2007
Springer
OpenMP is widely used for shared memory parallel programming and is especially useful for the parallelisation of loops. When it comes to task parallelism, however, OpenMP is less p...
81
Voted
ATAL
2005
Springer
15 years 5 months ago
2005
Springer
The PartNET++ system is an experimental multi-agent-based simulation tool that uses a new model based on hyper-graphs for understanding partnership formation among heterogeneous a...
94
Voted
PLDI
2004
ACM
15 years 5 months ago
2004
ACM
Although dynamic program slicing was first introduced to aid in user level debugging, applications aimed at improving software quality, reliability, security, and performance hav...