Sciweavers

1984 search results - page 57 / 397
» Binary Component Adaptation
Sort
View
FOCS
1999
IEEE
15 years 2 months ago
Hardness of Approximating the Minimum Distance of a Linear Code
We show that the minimum distance of a linear code is not approximable to within any constant factor in random polynomial time (RP), unless nondeterministic polynomial time (NP) eq...
Ilya Dumer, Daniele Micciancio, Madhu Sudan
TIP
1998
137views more  TIP 1998»
14 years 9 months ago
Adaptive, quadratic preprocessing of document images for binarization
Abstract—This paper presents an adaptive algorithm for preprocessing document images prior to binarization in character recognition problems. Our method is similar in its approac...
Shan Mo, V. John Mathews
CVPR
2011
IEEE
14 years 5 months ago
Adapting an Object Detector by Considering the Worst Case: a Conservative Approach
The performance of an offline-trained classifier can be improved on-site by adapting the classifier towards newly acquired data. However, the adaptation rate is a tuning parame...
Guang Chen, TonyX. Han
ICSE
2000
IEEE-ACM
15 years 1 months ago
A case study: demands on component-based development
Building software systems with reusable components brings many advantages. The development becomes more efficient, the reliability of the products is enhanced, and the maintenance...
Ivica Crnkovic, Magnus Larsson
ECOOPW
1998
Springer
15 years 2 months ago
Run-Time Adaptability of Synchronization Policies in Concurrent Object Oriented Languages
Adaptability has become one of the most important research areas in concurrent object-oriented systems in recent years. It tries to cope with system evolution by adding/replacing ...
Fernando Sánchez, Juan Hernández N&u...