Sciweavers

16 search results - page 3 / 4
» The maximum edit distance from hereditary graph properties
Sort
View
ICSM
1999
IEEE
13 years 10 months ago
Maintaining Traceability During Object-Oriented Software Evolution: A Case Study
This paper presents an approach to build and visualize traceability links and properties of a set of OO software releases. The process recovers an "as is" design from C+...
Giuliano Antoniol, Gerardo Canfora, Andrea De Luci...
ICALP
2011
Springer
12 years 9 months ago
Vertex Cover in Graphs with Locally Few Colors
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
Fabian Kuhn, Monaldo Mastrolilli
RECOMB
2010
Springer
14 years 1 months ago
Dense Subgraphs with Restrictions and Applications to Gene Annotation Graphs
Abstract. In this paper, we focus on finding complex annotation patterns representing novel and interesting hypotheses from gene annotation data. We define a generalization of th...
Barna Saha, Allison Hoch, Samir Khuller, Louiqa Ra...
TVCG
2010
129views more  TVCG 2010»
13 years 4 months ago
Projector Placement Planning for High Quality Visualizations on Real-World Colored Objects
—Many visualization applications benefit from displaying content on real-world objects rather than on a traditional display (e.g., a monitor). This type of visualization display ...
Alvin J. Law, Daniel G. Aliaga, Aditi Majumder
CORR
2008
Springer
174views Education» more  CORR 2008»
13 years 6 months ago
Bounded Budget Connection (BBC) Games or How to make friends and influence people, on a budget
Motivated by applications in social networks, peer-to-peer and overlay networks, we define and study the Bounded Budget Connection (BBC) game - we have a collection of n players o...
Nikolaos Laoutaris, Laura J. Poplawski, Rajmohan R...