Sciweavers

253 search results - page 44 / 51
» Testing subgraphs in directed graphs
Sort
View
KDD
2012
ACM
196views Data Mining» more  KDD 2012»
12 years 8 days ago
Chromatic correlation clustering
We study a novel clustering problem in which the pairwise relations between objects are categorical. This problem can be viewed as clustering the vertices of a graph whose edges a...
Francesco Bonchi, Aristides Gionis, Francesco Gull...
CVPR
2010
IEEE
14 years 6 months ago
Learning Full Pairwise Affinities for Spectral Segmentation
This paper studies the problem of learning a full range of pairwise affinities gained by integrating local grouping cues for spectral segmentation. The overall quality of the spect...
Tae Hoon Kim (Seoul National University), Kyoung M...
OOPSLA
2010
Springer
13 years 8 months ago
A simple inductive synthesis methodology and its applications
Given a high-level specification and a low-level programming language, our goal is to automatically synthesize an efficient program that meets the specification. In this paper,...
Shachar Itzhaky, Sumit Gulwani, Neil Immerman, Moo...
RECOMB
2006
Springer
14 years 10 months ago
Probabilistic Paths for Protein Complex Inference
Understanding how individual proteins are organized into complexes and pathways is a significant current challenge. We introduce new algorithms to infer protein complexes by combin...
Hailiang Huang, Lan V. Zhang, Frederick P. Roth, J...
ICSM
2002
IEEE
14 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