Sciweavers

1127 search results - page 142 / 226
» Theory Extension in ACL2(r)
Sort
View
PVLDB
2010
120views more  PVLDB 2010»
15 years 4 months ago
EXTRUCT: Using Deep Structural Information in XML Keyword Search
Users who are unfamiliar with database query languages can search XML data sets using keyword queries. Previous work has shown that current XML keyword search methods, although in...
Arash Termehchy, Marianne Winslett
AML
2011
204views Mathematics» more  AML 2011»
15 years 1 months ago
A note on propositional proof complexity of some Ramsey-type statements
Any valid Ramsey statement n −→ (k)2 2 can be encoded into a DNF formula RAM(n, k) of size O(nk) and with terms of size k 2 . Let rk be the minimal n for which the statement h...
Jan Krajícek
3DIM
2011
IEEE
14 years 6 months ago
A Non-cooperative Game for 3D Object Recognition in Cluttered Scenes
Abstract—During the last few years a wide range of algorithms and devices have been made available to easily acquire range images. To this extent, the increasing abundance of dep...
Andrea Albarelli, Emanuele Rodolà, Filippo ...
ISCI
2008
181views more  ISCI 2008»
15 years 6 months ago
Attribute reduction in decision-theoretic rough set models
Rough set theory can be applied to rule induction. There are two different types of classification rules, positive and boundary rules, leading to different decisions and consequen...
Yiyu Yao, Yan Zhao
APAL
2004
105views more  APAL 2004»
15 years 6 months ago
Dual weak pigeonhole principle, Boolean complexity, and derandomization
We study the extension (introduced as BT in [5]) of the theory S1 2 by instances of the dual (onto) weak pigeonhole principle for p-time functions, dWPHP(PV )x x2 . We propose a n...
Emil Jerábek