1136 search results - page 43 / 228 » Finding Small Holes |
ANLP
1997
13 years 10 months ago
1997
We describe and experimentally evaluate an efficient method for automatically determining small clause boundaries in spontaneous speech. Our method applies an artificial neural ne...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
Huffman coding finds an optimal prefix code for a given probability mass function. Consider situations in which one wishes to find an optimal code with the restriction that all cod...
MOBIHOC
2002
ACM
14 years 8 months ago
2002
ACM
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
AAAI
1990
13 years 10 months ago
1990
Bandwidth is a fundamental concept in graph theory which has some surprising applications to a class of AI search problems. Graph bandwidth provides a link between the syntactic s...
ICML
2004
IEEE
14 years 10 months ago
2004
IEEE
This paper addresses the problem of finding a small and coherent subset of points in a given data. This problem, sometimes referred to as one-class or set covering, requires to fi...