Sciweavers

254 search results - page 11 / 51
» Binary amiable Words
Sort
View
CONCUR
2012
Springer
13 years 1 months ago
MSO Decidability of Multi-Pushdown Systems via Split-Width
Abstract. Multi-threaded programs with recursion are naturally modeled as multi-pushdown systems. The behaviors are represented as multiply nested words (MNWs), which are words enr...
Aiswarya Cyriac, Paul Gastin, K. Narayan Kumar
84
Voted
FOCS
2004
IEEE
15 years 2 months ago
Dynamic Optimality -- Almost
We present an O(lg lg n)-competitive online binary search tree, improving upon the best previous (trivial) competitive ratio of O(lg n). This is the first major progress on Sleator...
Erik D. Demaine, Dion Harmon, John Iacono, Mihai P...
ICDAR
2007
IEEE
15 years 5 months ago
Segmentation Based Recovery of Arbitrarily Warped Document Images
Non-linear warping appears in document images when captured by a digital camera or a scanner, especially in the case that these documents are digitized bounded volumes. Arbitraril...
Basilios Gatos, Ioannis Pratikakis, Konstantinos N...
ICDAR
2003
IEEE
15 years 4 months ago
A Character Recognizer for Turkish Language
This paper presents particularly a contextual post processing subsystem for a Turkish machine printed character recognition system. The contextual post processing subsystem is bas...
Sait Ulas Korkmaz, G. Kirçiçegi, Y. ...
82
Voted
JUCS
2010
110views more  JUCS 2010»
14 years 5 months ago
On Choice Principles and Fan Theorems
: Veldman proved that the contrapositive of countable binary choice is a theorem of full-fledged intuitionism, to which end he used a principle of continuous choice and the fan the...
Hannes Diener, Peter Schuster