Sciweavers

2661 search results - page 190 / 533
» Quantum Complexity Classes
Sort
View
116
Voted
ICDAR
1995
IEEE
15 years 7 months ago
A knowledge-based approach to the layout analysis
In this paper, we present a hybrid approach to the problem of the document analysis in which the document image is segmented by means of a top-down technique and then basic blocks...
Floriana Esposito, Donato Malerba, Giovanni Semera...
104
Voted
CJ
2010
98views more  CJ 2010»
15 years 3 months ago
On Ultrametric Algorithmic Information
How best to quantify the information of an object, whether natural or artifact, is a problem of wide interest. A related problem is the computability of an object. We present prac...
Fionn Murtagh
141
Voted
CORR
2008
Springer
107views Education» more  CORR 2008»
15 years 3 months ago
Power Series Composition and Change of Basis
Efficient algorithms are known for many operations on truncated power series (multiplication, powering, exponential, . . . ). Composition is a more complex task. We isolate a larg...
Alin Bostan, Bruno Salvy, Éric Schost
DAM
2008
111views more  DAM 2008»
15 years 3 months ago
Games played by Boole and Galois
We define an infinite class of 2-pile subtraction games, where the amount that can be subtracted from both piles simultaneously is an extended Boolean function f of the size of th...
Aviezri S. Fraenkel
MOC
1998
107views more  MOC 1998»
15 years 3 months ago
A new parallel chasing algorithm for transforming arrowhead matrices to tridiagonal form
Rutishauser, Gragg and Harrod and finally H.Y. Zha used the same class of chasing algorithms for transforming arrowhead matrices to tridiagonal form. Using a graphical theoretical...
Suely Oliveira