132 search results - page 11 / 27 » A Simple Test for Interval Graphs |
116
click to vote
ACIVS
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. In this work we introduce a new technique for a frequently encountered problem in computer vision: image registration. The registration is computed by matching features, ...
78
Voted
GD
2004
Springer
15 years 7 months ago
2004
Springer
In this paper we study simple families of clustered graphs that are highly unconnected. We start by studying 3-cluster cycles, which are clustered graphs such that the underlying ...
121
click to vote
CORR
2008
Springer
15 years 1 months ago
2008
Springer
We present a deterministic way of assigning small (log bit) weights to the edges of a bipartite planar graph so that the minimum weight perfect matching becomes unique. The isolati...
99
Voted
BMCBI
2007
15 years 1 months ago
2007
Background: Accurate prediction of intra-protein residue contacts from sequence information will allow the prediction of protein structures. Basic predictions of such specific con...
108
Voted
COMPSAC
2009
IEEE
15 years 8 months ago
2009
IEEE
—This paper considers the task of software test case generation from a large space of values of input parameters. The purpose of the paper is to create a model of software input ...