1093 search results - page 34 / 219 » Clustering from Constraint Graphs |
136
click to vote
ECML
2004
Springer
15 years 8 months ago
2004
Springer
This work presents a novel procedure for computing (1) distances between nodes of a weighted, undirected, graph, called the Euclidean Commute Time Distance (ECTD), and (2) a subspa...
113
click to vote
CAV
2009
Springer
16 years 3 months ago
2009
Springer
Abstract. Size-change termination involves deducing program termination based on the impossibility of infinite descent. To this end we may use m abstraction in which transitions ar...
130
click to vote
APVIS
2010
15 years 4 months ago
2010
Information visualization is essential in making sense out of large data sets. Often, high-dimensional data are visualized as a collection of points in 2-dimensional space through...
129
click to vote
EACL
2006
ACL Anthology
15 years 4 months ago
2006
ACL Anthology
We investigate a series of graph-theoretic constraints on non-projective dependency parsing and their effect on expressivity, i.e. whether they allow naturally occurring syntactic...
128
Voted
COMPSAC
2009
IEEE
15 years 10 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 ...