2489 search results - page 41 / 498 » On the Subgroup Distance Problem |
85
Voted
DAGM
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. During recent years much effort has been spent in incorporating problem specific a-priori knowledge into kernel methods for machine learning. A common example is a-prior...
94
Voted
ESA
2007
Springer
15 years 7 months ago
2007
Springer
Given a graph G = (V, E), a (d, k)-coloring is a function from the vertices V to colors {1, 2, . . . , k} such that any two vertices within distance d of each other are assigned di...
109
Voted
MLCW
2005
Springer
15 years 6 months ago
2005
Springer
Textual Entailment recognition is a very difficult task as it is one of the fundamental problems in any semantic theory of natural language. As in many other NLP tasks, Machine Lea...
WCRE
1999
IEEE
15 years 5 months ago
1999
IEEE
The software clustering problem has attracted much attention recently, since it is an integral part of the process of reverse engineering large software systems. A key problem in ...
116
click to vote
SODA
2008
ACM
15 years 2 months ago
2008
ACM
In this paper we consider problems related to the sortedness of a data stream. First we investigate the problem of estimating the distance to monotonicity; given a sequence of len...