Sciweavers

1056 search results - page 160 / 212
» Constraint-Based Graph Matching
Sort
View
ICDE
2009
IEEE
108views Database» more  ICDE 2009»
14 years 3 months ago
Galaxy: Encouraging Data Sharing among Sources with Schema Variants
This demonstration presents Galaxy, a schema manager that facilitates easy and correct data sharing among autonomous but related, evolving data sources. Galaxy reduces heterogenei...
Peter Mork, Len Seligman, Arnon Rosenthal, Michael...
APPROX
2009
Springer
125views Algorithms» more  APPROX 2009»
14 years 3 months ago
Minimizing Average Shortest Path Distances via Shortcut Edge Addition
We consider adding k shortcut edges (i.e. edges of small fixed length δ ≥ 0) to a graph so as to minimize the weighted average shortest path distance over all pairs of vertices...
Adam Meyerson, Brian Tagiku
ESA
2009
Springer
109views Algorithms» more  ESA 2009»
14 years 3 months ago
Iterative Rounding for Multi-Objective Optimization Problems
In this paper we show that iterative rounding is a powerful and flexible tool in the design of approximation algorithms for multiobjective optimization problems. We illustrate tha...
Fabrizio Grandoni, R. Ravi, Mohit Singh
COMPSAC
2007
IEEE
14 years 3 months ago
A Combined Concept Location Method for Java Programs
Concept location is one of the fundamental activities during software maintenance which locates the parts of the source code where a specific concept is implemented. The methods f...
Dapeng Liu, Shaochun Xu
COCOON
2007
Springer
14 years 3 months ago
On the Complexity of Finding an Unknown Cut Via Vertex Queries
We investigate the problem of finding an unknown cut through querying vertices of a graph G. Our complexity measure is the number of submitted queries. To avoid some worst cases, ...
Peyman Afshani, Ehsan Chiniforooshan, Reza Dorrigi...