Sciweavers

478 search results - page 3 / 96
» Improving probability bounds by optimization over subsets
Sort
View
ALGORITHMICA
1998
81views more  ALGORITHMICA 1998»
13 years 7 months ago
The List Update Problem: Improved Bounds for the Counter Scheme
We consider the problem of dynamic reorganization of a linear list, where requests for the elements are generated randomly with fixed, unknown probabilities. The objective is to ...
Hadas Shachnai, Micha Hofri
JMLR
2012
11 years 10 months ago
Bounding the Probability of Error for High Precision Optical Character Recognition
We consider a model for which it is important, early in processing, to estimate some variables with high precision, but perhaps at relatively low recall. If some variables can be ...
Gary B. Huang, Andrew Kae, Carl Doersch, Erik G. L...
APNOMS
2006
Springer
13 years 11 months ago
The Soft Bound Admission Control Algorithm for Vertical Handover in Ubiquitous Environment
Abstract. In this paper, we present SBAC (Soft Bound Admission Control) algorithm considering critical bandwidth ratio to reduce handover blocking probability over WLAN and WAAN (W...
Ok Sik Yang, Jong Min Lee, Jun Kyun Choi, Seong Go...
ICASSP
2011
IEEE
12 years 11 months ago
A combinatorial optimization framework for subset selection in distributed multiple-radar architectures
Abstract—Widely distributed multiple radar architectures offer parameter estimation improvement for target localization. For a large number of radars, the achievable localization...
Hana Godrich, Athina P. Petropulu, H. Vincent Poor
ICPR
2002
IEEE
14 years 8 months ago
An Iterative Algorithm for Optimal Style Conscious Field Classification
Modeling consistency of style in isogenous fields of patterns (such as character patterns in a word from the same font or writer) can improve classification accuracy. Since such p...
Prateek Sarkar