523 search results - page 83 / 105 » Decidability of string graphs |
89
Voted
COMGEO
2011
ACM
14 years 4 months ago
2011
ACM
A drawing of a graph in the plane is called a thrackle if every pair of edges meets precisely once, either at a common vertex or at a proper crossing. Let t(n) denote the maximum ...
ICML
2006
IEEE
15 years 10 months ago
2006
IEEE
The power and popularity of kernel methods stem in part from their ability to handle diverse forms of structured inputs, including vectors, graphs and strings. Recently, several m...
ECML
2007
Springer
15 years 3 months ago
2007
Springer
The problem of learning metrics between structured data (strings, trees or graphs) has been the subject of various recent papers. With regard to the specific case of trees, some a...
85
Voted
SCAM
2006
IEEE
15 years 3 months ago
2006
IEEE
Programmers often want to transform the source or binary representations of their programs (e.g., to optimize, add dynamic safety checks, or add profile gathering code). Unfortun...
SWAT
2004
Springer
15 years 2 months ago
2004
Springer
In this paper, we investigate the test set problem and its variations that appear in a variety of applications. In general, we are given a universe of objects to be “distinguish...