6740 search results - page 1104 / 1348 » An s -Hamiltonian Line Graph Problem |
191
click to vote
NIPS
2001
15 years 8 months ago
2001
We describe the application of kernel methods to Natural Language Processing (NLP) problems. In many NLP tasks the objects being modeled are strings, trees, graphs or other discre...
168
click to vote
NIPS
2003
15 years 8 months ago
2003
In this paper we present Discriminative Random Fields (DRF), a discriminative framework for the classification of natural image regions by incorporating neighborhood spatial depe...
187
click to vote
SPLST
2003
15 years 8 months ago
2003
Abstract. In this paper, we consider the aesthetic criteria and constraints related to the layouts of UML sequence diagrams. We consider the applicability of the traditional graph ...
181
click to vote
PSTV
1993
15 years 8 months ago
1993
We present a new algorithm that can be used for solving the model−checking problem for linear−time temporal logic. This algorithm can be viewed as the combination of two exist...
169
click to vote
CIDR
2009
15 years 7 months ago
2009
Enterprise environments have isolated teams responsible separately for database management and the management of underlying networkattached server-storage infrastructure (referred...