Sciweavers

10493 search results - page 37 / 2099
» Dynamic Word Problems
Sort
View
ICDAR
2009
IEEE
13 years 5 months ago
HMM Based Handwritten Word Recognition System by Using Singularities
This paper presents a new approach for Handwritten Word Recognition based on Hidden Markov Model theory and the sliding window technique. The new approach uses specific singularit...
Sebastiano Impedovo, Anna Ferrante, Raffaele Modug...
IEEEPACT
2003
IEEE
14 years 1 months ago
Reactive Multi-Word Synchronization for Multiprocessors
Shared memory multiprocessor systems typically provide a set of hardware primitives in order to support synchronization. Generally, they provide single-word read-modify-write hard...
Phuong Hoai Ha, Philippas Tsigas
ICDAR
2003
IEEE
14 years 1 months ago
Handwritten Word Recognition based on Structural Characteristics and Lexical Support
In this paper a handwritten recognition algorithm based on structural characteristics, histograms and profiles, is presented. The well-known horizontal and vertical histograms are...
Ergina Kavallieratou, Kyriakos N. Sgarbas, Nikos F...
ISAAC
2009
Springer
132views Algorithms» more  ISAAC 2009»
14 years 2 months ago
Hilbert's Thirteenth Problem and Circuit Complexity
We study the following question, communicated to us by Mikl´os Ajtai: Can all explicit (e.g., polynomial time computable) functions f : ({0, 1}w )3 → {0, 1}w be computed by word...
Kristoffer Arnsfelt Hansen, Oded Lachish, Peter Br...
JUCS
2010
142views more  JUCS 2010»
13 years 6 months ago
Mobile Agent Routing with Time Constraints: A Resource Constrained Longest-Path Approach
: Mobile agent technology advocates the mobility of code rather than the transfer of data. As data is found in several sites, a mobile agent has to plan an itinerary to visit sever...
Eduardo Camponogara, Ricardo Boveto Shima