Sciweavers

1650 search results - page 316 / 330
» The HOM problem is decidable
Sort
View
ICDAR
2005
IEEE
14 years 1 months ago
Improved Text-Detection Methods for a Camera-based Text Reading System for Blind Persons
Automatic text recognition from natural images receives a growing attention because of potential applications in image retrieval, robotics and intelligent transport system. Camera...
Nobuo Ezaki, Kimiyasu Kiyota, Bui Truong Minh, Mar...
COCO
2005
Springer
123views Algorithms» more  COCO 2005»
14 years 1 months ago
If NP Languages are Hard on the Worst-Case Then It is Easy to Find Their Hard Instances
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma
SAC
2004
ACM
14 years 1 months ago
Forest trees for on-line data
This paper presents an hybrid adaptive system for induction of forest of trees from data streams. The Ultra Fast Forest Tree system (UFFT) is an incremental algorithm, with consta...
João Gama, Pedro Medas, Ricardo Rocha
SPAA
2004
ACM
14 years 1 months ago
Adaptive channel queue routing on k-ary n-cubes
This paper introduces a new adaptive method, Channel Queue Routing (CQR), for load-balanced routing on k-ary n-cube interconnection networks. CQR estimates global congestion in th...
Arjun Singh, William J. Dally, Amit K. Gupta, Bria...
FASE
2004
Springer
14 years 1 months ago
Consistent Adaptation and Evolution of Class Diagrams during Refinement
Abstract. Software models are key in separating and solving independent development concerns. However, there is still a gap on how to transition design information among these sepa...
Alexander Egyed