89222 search results - page 47 / 17845 » Which |
97
Voted
DLOG
1996
15 years 2 months ago
1996
To ensure the re-use of domain ontologies the usual approach relies on a pivot language, e.g., Kif, intoandfromwhich the domainontologyis translated. This requires several distinc...
100
Voted
COMBINATORICA
2007
15 years 25 days ago
2007
A colored graph is a complete graph in which a color has been assigned to each edge, and a colorful cycle is a cycle in which each edge has a different color. We first show that ...
TCS
2008
15 years 22 days ago
2008
The edge dominating set (EDS) and edge cover (EC) problems are classical graph covering problems in which one seeks a minimum cost collection of edges which covers the edges or ve...
85
Voted
JOLLI
2000
15 years 18 days ago
2000
Alan Turing devised his famous test (TT) through a slight modification of the parlor game in which a judge tries to ascertain the gender of two people who are only linguistically a...
108
Voted
DATAMINE
1998
15 years 15 days ago
1998
The tutorial starts with an overview of the concepts of VC dimension and structural risk minimization. We then describe linear Support Vector Machines (SVMs) for separable and non-...