Sciweavers

3008 search results - page 283 / 602
» Independence in connected graphs
Sort
View
ISBRA
2007
Springer
16 years 26 days ago
Discovering Relations Among GO-Annotated Clusters by Graph Kernel Methods
The biological interpretation of large-scale gene expression data is one of the challenges in current bioinformatics. The state-of-theart approach is to perform clustering and then...
Italo Zoppis, Daniele Merico, Marco Antoniotti, Bu...
AOSD
2006
ACM
16 years 21 days ago
Towards supporting on-demand virtual remodularization using program graphs
OOP style requires programmers to organize their code according to objects (or nouns, using natural language as a metaphor), causing a program’s actions (verbs) to become scatte...
David Shepherd, Lori L. Pollock, K. Vijay-Shanker
WEBI
2005
Springer
16 years 5 days ago
A Novel Way of Computing Similarities between Nodes of a Graph, with Application to Collaborative Recommendation
This work presents a new perspective on characterizing the similarity between elements of a database or, more generally, nodes of a weighted, undirected, graph. It is based on a M...
François Fouss, Alain Pirotte, Marco Saeren...
ER
2004
Springer
79views Database» more  ER 2004»
16 years 3 days ago
Multi-phase Process Mining: Building Instance Graphs
Abstract. Deploying process-driven information systems is a time-consuming and error-prone task. Process mining attempts to improve this by automatically generating a process model...
Boudewijn F. van Dongen, Wil M. P. van der Aalst
SODA
2008
ACM
127views Algorithms» more  SODA 2008»
15 years 8 months ago
Nondecreasing paths in a weighted graph or: how to optimally read a train schedule
A travel booking office has timetables giving arrival and departure times for all scheduled trains, including their origins and destinations. A customer presents a starting city a...
Virginia Vassilevska