10493 search results - page 1637 / 2099 » Dynamic Word Problems |
156
click to vote
CPM
2006
Springer
15 years 7 months ago
2006
Springer
The Range-Minimum-Query-Problem is to preprocess an array such that the position of the minimum element between two specified indices can be obtained efficiently. We present a dire...
128
click to vote
DAS
2006
Springer
15 years 7 months ago
2006
Springer
Traditional approaches to combining classifiers attempt to improve classification accuracy at the cost of increased processing. They may be viewed as providing an accuracy-speed tr...
139
click to vote
DBISP2P
2006
Springer
15 years 7 months ago
2006
Springer
The processing of k-NN queries has been studied extensively both in a centralized computing environment and in a structured P2P environment. However, the problem over an unstructur...
117
click to vote
ECML
2006
Springer
15 years 7 months ago
2006
Springer
In this paper we formulate the problem of grouping the states of a discrete Markov chain of arbitrary order simultaneously with deconvolving its transition probabilities. As the na...
102
click to vote
EUC
2006
Springer
15 years 7 months ago
2006
Springer
Runtime data alignment has been paid attention recently since it can allocate data segment to processors dynamically according to applications' requirement. One of the key opt...