Sciweavers

42 search results - page 5 / 9
» Weighted Timed MSO Logics
Sort
View
ESA
2010
Springer
172views Algorithms» more  ESA 2010»
13 years 8 months ago
Algorithmic Meta-theorems for Restrictions of Treewidth
Abstract. Possibly the most famous algorithmic meta-theorem is Courcelle's theorem, which states that all MSO-expressible graph properties are decidable in linear time for gra...
Michael Lampis
IEEEMSP
2002
IEEE
167views Multimedia» more  IEEEMSP 2002»
14 years 9 days ago
An experimental study on the performance of visual information retrieval similarity models
–This paper is an experimental study on the performance of the two major methods for macro-level similarity measurement: linear weighted merging and logical retrieval. Performanc...
Horst Eidenberger, Christian Breiteneder
GRAMMARS
2000
97views more  GRAMMARS 2000»
13 years 7 months ago
Proof-Nets, Hybrid Logics and Minimalist Representations
Inthis paper, we aim at giving alogical account of the representationalist view on minimalist grammars by refering to the notion of Proof-Net in Linear Logic. We propose at the sam...
Alain Lecomte
ML
2007
ACM
130views Machine Learning» more  ML 2007»
13 years 6 months ago
Interactive learning of node selecting tree transducer
We develop new algorithms for learning monadic node selection queries in unranked trees from annotated examples, and apply them to visually interactive Web information extraction. ...
Julien Carme, Rémi Gilleron, Aurélie...
GLVLSI
2008
IEEE
120views VLSI» more  GLVLSI 2008»
14 years 1 months ago
SAT-based equivalence checking of threshold logic designs for nanotechnologies
Novel nano-scale devices have shown promising potential to overcome physical barriers faced by complementary metaloxide semiconductor (CMOS) technology in future circuit design. H...
Yexin Zheng, Michael S. Hsiao, Chao Huang