Sciweavers

779 search results - page 142 / 156
» Algorithms for the Sample Mean of Graphs
Sort
View
FOCS
2002
IEEE
15 years 2 months ago
Covering Problems with Hard Capacities
We consider the classical vertex cover and set cover problems with the addition of hard capacity constraints. This means that a set (vertex) can only cover a limited number of its...
Julia Chuzhoy, Joseph Naor
ICSM
2002
IEEE
15 years 2 months ago
Static and Dynamic C++ Code Analysis for the Recovery of the Object Diagram
When a software system enters the maintenance phase, the availability of accurate and consistent information about its organization can help alleviate the difficulties of program...
Paolo Tonella, Alessandra Potrich
FMOODS
2006
14 years 11 months ago
Generating Instance Models from Meta Models
Meta modeling is a wide-spread technique to define visual languages, with the UML being the most prominent one. Despite several advantages of meta modeling such as ease of use, the...
Karsten Ehrig, Jochen Malte Küster, Gabriele ...
VMV
2001
161views Visualization» more  VMV 2001»
14 years 11 months ago
Viewpoint Selection using Viewpoint Entropy
Computation of good viewpoints is important in several fields: computational geometry, visual servoing, robot motion, graph drawing, etc. In addition, selection of good views is r...
Pere-Pau Vázquez, Miquel Feixas, Mateu Sber...
AC
2008
Springer
14 years 10 months ago
Distributed Sparse Matrices for Very High Level Languages
Sparse matrices are first class objects in many VHLLs (very high level languages) used for scientific computing. They are a basic building block for various numerical and combinat...
John R. Gilbert, Steve Reinhardt, Viral Shah