7380 search results - page 400 / 1476 » time 2008 |
177
click to vote
DLOG
2008
15 years 9 months ago
2008
Representing probabilistic knowledge in combination with a description logic has been a research topic for quite some time. In [1] one of such combinations is introduced. We presen...
184
click to vote
CIKM
2008
Springer
15 years 8 months ago
2008
Springer
We present an approach to document clustering based on winnowing fingerprints that achieved good values of effectiveness with considerable save in memory space and computation tim...
182
click to vote
AAECC
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. In this paper we show that the separable decomposition of a univariate polynomial can be computed in softly optimal time, in terms of the number of arithmetic operations ...
161
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
We study two distinct, but overlapping, networks which operate at the same time, space and frequency. The first network consists of
122
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
The cornerstone of any algorithm computing all repetitions in a string of length n in O(n) time is the fact that the number of runs (or maximal repetitions) is O(n). We give a simp...