7811 search results - page 1319 / 1563 » computing 2004 |
140
click to vote
SSPR
2004
Springer
15 years 9 months ago
2004
Springer
We present a novel clustering method using HMM parameter space and eigenvector decomposition. Unlike the existing methods, our algorithm can cluster both constant and variable leng...
138
click to vote
SWAT
2004
Springer
15 years 9 months ago
2004
Springer
In this paper, we investigate the test set problem and its variations that appear in a variety of applications. In general, we are given a universe of objects to be “distinguish...
118
Voted
SWAT
2004
Springer
15 years 9 months ago
2004
Springer
The standard dynamic programming solution to finding k-medians on a line with n nodes requires O(kn2 ) time. Dynamic programming speedup techniques, e.g., use of the quadrangle i...
144
click to vote
TACAS
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. We study schedulability problems of timed systems with nonuniformly recurring computation tasks. Assume a set of real time tasks whose best and worst execution times, and...
148
click to vote
UCS
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. We propose a unified ubiHome application service model which provides user-centered services by exploiting intelligent context-awareness. Recently, most of research relat...