Sciweavers

3244 search results - page 293 / 649
» On convex complexity measures
Sort
View
ML
2000
ACM
103views Machine Learning» more  ML 2000»
15 years 6 months ago
Nonparametric Time Series Prediction Through Adaptive Model Selection
We consider the problem of one-step ahead prediction for time series generated by an underlying stationary stochastic process obeying the condition of absolute regularity, describi...
Ron Meir
IR
2002
15 years 6 months ago
Threshold Setting and Performance Optimization in Adaptive Filtering
An experimental adaptive filtering system, built on the Okapi search engine, is described. In addition to the regular text retrieval functions, the system requires a complex set o...
Stephen E. Robertson
IANDC
1998
72views more  IANDC 1998»
15 years 6 months ago
On the Modelling of Search in Theorem Proving - Towards a Theory of Strategy Analysis
We present a model for representing search in theorem proving. This model captures the notion of contraction, which has been central in some of the recent developments in theorem ...
Maria Paola Bonacina, Jieh Hsiang
WINET
2002
103views more  WINET 2002»
15 years 6 months ago
LeZi-Update: An Information-Theoretic Framework for Personal Mobility Tracking in PCS Networks
The complexity of the mobility tracking problem in a cellular environment has been characterized under an information-theoretic framework. Shannon's entropy measure is identif...
Amiya Bhattacharya, Sajal K. Das
CORR
2011
Springer
183views Education» more  CORR 2011»
15 years 1 months ago
Mean-Variance Optimization in Markov Decision Processes
We consider finite horizon Markov decision processes under performance measures that involve both the mean and the variance of the cumulative reward. We show that either randomiz...
Shie Mannor, John N. Tsitsiklis