Sciweavers

1715 search results - page 164 / 343
» How Space Structures Language
Sort
View
KES
2008
Springer
15 years 3 months ago
Classification and Retrieval through Semantic Kernels
Abstract. This work proposes a family of language-independent semantic kernel functions defined for individuals in an ontology. This allows exploiting wellfounded kernel methods fo...
Claudia d'Amato, Nicola Fanizzi, Floriana Esposito
143
Voted
ICML
2004
IEEE
16 years 4 months ago
Kernel conditional random fields: representation and clique selection
Kernel conditional random fields (KCRFs) are introduced as a framework for discriminative modeling of graph-structured data. A representer theorem for conditional graphical models...
John D. Lafferty, Xiaojin Zhu, Yan Liu
ICPR
2008
IEEE
15 years 10 months ago
An approximate algorithm for median graph computation using graph embedding
Graphs are powerful data structures that have many attractive properties for object representation. However, some basic operations are difficult to define and implement, for ins...
Miquel Ferrer, Ernest Valveny, Francesc Serratosa,...
CAISE
2007
Springer
15 years 9 months ago
Error Metrics for Business Process Models
Little research has been conducted so far on causes for errors in business process models. In this paper we investigate on how mainly domain independent factors such as the size or...
Jan Mendling, Gustaf Neumann
119
Voted
CPM
2007
Springer
134views Combinatorics» more  CPM 2007»
15 years 7 months ago
Efficient Computation of Substring Equivalence Classes with Suffix Arrays
This paper considers enumeration of substring equivalence classes introduced by Blumer et al. [1]. They used the equivalence classes to define an index structure called compact dir...
Kazuyuki Narisawa, Shunsuke Inenaga, Hideo Bannai,...