Sciweavers

1162 search results - page 113 / 233
» Minimum Cycle Bases in Graphs Algorithms and Applications
Sort
View
SEMWEB
2007
Springer
14 years 2 months ago
Structure Preserving Semantic Matching
Abstract The most common matching applications, e.g., ontology matching, focus on the computation of the correspondences holding between the nodes of graph structures (e.g., concep...
Fausto Giunchiglia, Mikalai Yatskevich, Fiona McNe...
GD
2004
Springer
14 years 1 months ago
Distributed Graph Layout for Sensor Networks
Sensor network applications frequently require that the sensors know their physical locations in some global coordinate system. This is usually achieved by equipping each sensor w...
Craig Gotsman, Yehuda Koren
JCB
2007
99views more  JCB 2007»
13 years 8 months ago
Duplication and Inversion History of a Tandemly Repeated Genes Family
Given a phylogenetic tree for a family of tandemly repeated genes and their signed order on the chromosome, we aim to find the minimum number of inversions compatible with an evo...
Mathieu Lajoie, Denis Bertrand, Nadia El-Mabrouk, ...
PLDI
2004
ACM
14 years 1 months ago
Cost effective dynamic program slicing
Although dynamic program slicing was first introduced to aid in user level debugging, applications aimed at improving software quality, reliability, security, and performance hav...
Xiangyu Zhang, Rajiv Gupta
HPDC
2010
IEEE
13 years 9 months ago
Resource provisioning with budget constraints for adaptive applications in cloud environments
The recent emergence of clouds is making the vision of utility computing realizable, i.e. computing resources and services can be delivered, utilized, and paid for as utilities su...
Qian Zhu, Gagan Agrawal