Sciweavers

419 search results - page 65 / 84
» First Order Paths in Ordered Trees
Sort
View
TCAD
1998
125views more  TCAD 1998»
13 years 9 months ago
BDD-based synthesis of extended burst-mode controllers
Abstract—We examine the implications of a new hazard-free combinational logic synthesis method [1], which generates multiplexor-based networks from binary decision diagrams (BDDs...
Kenneth Y. Yun, Bill Lin, David L. Dill, Srinivas ...
ICDAR
2011
IEEE
12 years 9 months ago
Fast Key-Word Searching via Embedding and Active-DTW
—In this paper we present a novel approach for fast search of handwritten Arabic word-parts within large lexicons. The algorithm runs through three steps to achieve the required ...
Raid Saabni, Alex Bronstein
CC
2003
Springer
250views System Software» more  CC 2003»
14 years 3 months ago
Automatic Detection of Uninitialized Variables
vel Meta-Reasoning with Higher-Order Abstract Syntax Alberto Momigliano, Simon Ambler. A Normalisation Result for Higher-Order Calculi with Explicit Substitutions Eduardo Bonelli. ...
Thi Viet Nga Nguyen, François Irigoin, Cori...
CSCLP
2008
Springer
13 years 11 months ago
An Efficient Decision Procedure for Functional Decomposable Theories Based on Dual Constraints
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...
Khalil Djelloul
PODS
2002
ACM
117views Database» more  PODS 2002»
14 years 10 months ago
Monadic Datalog and the Expressive Power of Languages for Web Information Extraction
Research on information extraction from Web pages (wrapping) has seen much activity in recent times (particularly systems implementations), but little work has been done on formal...
Georg Gottlob, Christoph Koch