1127 search results - page 148 / 226 » Testing the Expansion of a Graph |
102
click to vote
FLAIRS
2008
15 years 5 days ago
2008
The problem of recognizing textual entailment (RTE) has been recently addressed using syntactic and lexical models with some success. Here, we further explore this problem, this t...
TCS
2008
14 years 9 months ago
2008
The replication number of a branching program is the minimum number R such that along every accepting computation at most R variables are tested more than once; the sets of variab...
105
click to vote
ALGORITHMICA
1998
14 years 9 months ago
1998
The dominatingset problemin graphs asks for a minimumsize subset of vertices with the followingproperty: each vertex is required to either be in the dominating set, or adjacent to...
ICML
2005
IEEE
15 years 10 months ago
2005
IEEE
This paper presents a learning theoretical analysis of correlation clustering (Bansal et al., 2002). In particular, we give bounds on the error with which correlation clustering r...
ANTSW
2004
Springer
15 years 3 months ago
2004
Springer
In this paper, we describe how we can generate music by simulating moves of artificial ants on a graph where vertices represent notes and edges represent possible transitions betw...