Sciweavers

5981 search results - page 94 / 1197
» time 2006
Sort
View
137
Voted
JCO
2010
182views more  JCO 2010»
15 years 1 months ago
Polynomial time approximation schemes for minimum disk cover problems
The following planar minimum disk cover problem is considered in this paper: given a set D of n disks and a set P of m points in the Euclidean plane, where each disk covers a subse...
Chen Liao, Shiyan Hu
99
Voted
QUESTA
2000
68views more  QUESTA 2000»
15 years 3 months ago
Ergodicity of the BMAP/PH}/s/s+K retrial queue with PH-retrial times
Define the traffic intensity as the ratio of the arrival rate to the service rate. This paper shows that the BMAP/PH/s/s+K retrial queue with PH-retrial times is ergodic if and onl...
Qi-Ming He, Hui Li, Yiqiang Q. Zhao
JMLR
2006
118views more  JMLR 2006»
15 years 3 months ago
Learning Factor Graphs in Polynomial Time and Sample Complexity
We study the computational and sample complexity of parameter and structure learning in graphical models. Our main result shows that the class of factor graphs with bounded degree...
Pieter Abbeel, Daphne Koller, Andrew Y. Ng
108
Voted
JASIS
2010
121views more  JASIS 2010»
15 years 1 months ago
Linear time series models for term weighting in information retrieval
Common measures of term importance in information retrieval (IR) rely on counts of term frequency; rare terms receive higher weight in document ranking than common terms receive. ...
Miles Efron
119
Voted
ESANN
2006
15 years 4 months ago
Time series prediction using DirRec strategy
This paper demonstrates how the selection of Prediction Strategy is important in the Long-Term Prediction of Time Series. Two strategies are already used in the prediction purposes...
Antti Sorjamaa, Amaury Lendasse