Sciweavers

151 search results - page 16 / 31
» Handling Boolean A Boxes
Sort
View
CL
2000
Springer
13 years 12 months ago
Modelling Digital Circuits Problems with Set Constraints
A number of diagnostic and optimisation problems in Electronics Computer Aided Design have usually been handled either by specific tools or by mapping them into a general problem s...
Francisco Azevedo, Pedro Barahona
SODA
2012
ACM
195views Algorithms» more  SODA 2012»
11 years 10 months ago
Concentration and moment inequalities for polynomials of independent random variables
In this work we design a general method for proving moment inequalities for polynomials of independent random variables. Our method works for a wide range of random variables incl...
Warren Schudy, Maxim Sviridenko
TKDE
2010
149views more  TKDE 2010»
13 years 2 months ago
A Configurable Rete-OO Engine for Reasoning with Different Types of Imperfect Information
The RETE algorithm is a very efficient option for the development of a rule-based system, but it supports only boolean, first order logic. Many real-world contexts, instead, requir...
Davide Sottara, Paola Mello, Mark Proctor
ICDAR
2007
IEEE
14 years 1 months ago
A Weighted Finite-State Framework for Correcting Errors in Natural Scene OCR
With the increasing market of cheap cameras, natural scene text has to be handled in an efficient way. Some works deal with text detection in the image while more recent ones poi...
R. Beaufort, Céline Mancas-Thillou
PAMI
2002
86views more  PAMI 2002»
13 years 7 months ago
Recognizing Mathematical Expressions Using Tree Transformation
We describe a robust and efficient system for recognizing typeset and handwritten mathematical notation. From a list of symbols with bounding boxes the system analyzes an expressio...
Richard Zanibbi, Dorothea Blostein, James R. Cordy