48 Hits in 4.7 sec

Chain Length and CSPs Learnable with Few Queries

Christian Bessiere, Cl'ément Carbonnel, George Katsirelos
First, we use the notion of chain length to show that a wide class of languages can be learned with as few as O(n log(n)) queries.  ...  In this paper we focus on partial membership queries and initiate a systematic investigation of the learning complexity of constraint languages.  ...  If Γ is rectangular, then it has linear chain length and is learnable with O(n log(n)) partial membership queries. Otherwise, Γ is not learnable with o(n 2 ) Boolean queries.  ... 
doi:10.1609/aaai.v34i02.5499 fatcat:gyydspcag5gjng6peqyg2vwfbe

Inferring Obstacles and Path Validity from Visibility-Constrained Demonstrations [article]

Craig Knuth, Glen Chou, Necmiye Ozay, Dmitry Berenson
2020 arXiv   pre-print
We parameterize a set of obstacles corresponding to an assignment from the CSP and sample from the set to find valid environments.  ...  Given a set of survey points, which describe where the demonstrator obtains new information, and a candidate path, we construct a Constraint Satisfaction Problem (CSP) on a cell decomposition of the environment  ...  We see that safety improves with only a few samples and continues to improve with more samples and new assignments.  ... 
arXiv:2005.05421v1 fatcat:ye5kagv3hbak7lfsiwazwvmqim

Finitely related algebras in congruence modular varieties have few subpowers

Libor Barto
2018 Journal of the European Mathematical Society (Print)  
, the primitive positive formula comparison problem, and the learnability problem for primitive positive formulas.  ...  We show that every finite algebra, which is finitely related and lies in a congruence modular variety, has few subpowers.  ...  of the descending chain C 1 ⊇ C 2 ⊇ . . . and each C i in the chain has few subpowers (this follows from Theorem 1.1 since the class CM is closed under expansions).  ... 
doi:10.4171/jems/790 fatcat:i4qply3bbrcmxbulv42s5i7bqm

Analysis of Boolean Functions [article]

Ryan O'Donnell
2021 arXiv   pre-print
In both years most of Chapters 1-5 and 7 were covered, along with parts of Chapters 6, 8, 9, and 11, and some additional material on additive combinatorics.  ...  Each chapter ends with a "highlight" showing the power of analysis of Boolean functions in different subject areas: property testing, social choice, cryptography, circuit complexity, learning theory, pseudorandomness  ...  But it's easy to give a 3-query PCPP system for O with proof length n − 1 (and rejection rate 1).  ... 
arXiv:2105.10386v1 fatcat:h3tobmrcjbhh3euva6ogwiubya

Learning in Clausal Logic: A Perspective on Inductive Logic Programming [chapter]

Peter Flach, Nada Lavrač
2002 Lecture Notes in Computer Science  
On the other hand, significant advances have been made regarding dealing with noisy data, efficient heuristic and stochastic search methods, the use of logical representations going beyond definite clauses  ...  , and restricting the search space by means of declarative bias.  ...  Despite these claims and some initial investigations of intelligibility criteria for symbolic machine learning (such as Occam's razor and minimal description length criteria) there are few research results  ... 
doi:10.1007/3-540-45628-7_17 fatcat:i24bt6wv65crjjfybhcm7uwda4

Domain-independent planning for services in uncertain and dynamic environments

Eirini Kaldeli, Alexander Lazovik, Marco Aiello
2016 Artificial Intelligence  
Things have not developed as planned since, and at the end, I am still undecided whether he has been a constructive or distracting influence on my PhD.  ...  Following the thread that has lead me to pursuing a PhD, I ultimately find my parents, Rozina and Christophoros, who have always encouraged me to learn more.  ...  amount of the learnability effort between 0 and 0.25.  ... 
doi:10.1016/j.artint.2016.03.002 fatcat:ezhqok2ew5a3vjqbcyf5n53uti

Unconditional Lower Bounds in Complexity Theory

Igor Carboni Oliveira
We prove that the communication complexity of the Majority function on n-bit inputs with respect to Boolean circuits of size s and depth d extended with modulo p gates is precisely n/log^{ϴ(d)} s, where  ...  We study the learnability of circuits containing a given number of negation gates, a measure that interpolates between monotone functions, and the class of all functions. Let C^t_n be the cla [...]  ...  with few negations.  ... 
doi:10.7916/d8zp45kt fatcat:3qizieqkfrfhhezeevmdp5bcom

A survey and comparison of transformation tools based on the transformation tool contest

Edgar Jakumeit, Sebastian Buchwald, Dennis Wagelaar, Li Dan, Ábel Hegedüs, Markus Herrmannsdörfer, Tassilo Horn, Elina Kalnina, Christian Krause, Kevin Lano, Markus Lepper, Arend Rensink (+3 others)
2014 Science of Computer Programming  
Acknowledgements We want to thank Stephan Hildebrandt for his contributions to this article, the organizers of the Transformation Tool Contest for rendering this comparison possible, and the SHARE maintainers  ...  The case was designed to measure the ability of tools to capture non-local data; it required to follow chains of potentially unbounded length.  ...  Learnability "How easy is it to learn the tool and its languages?"  ... 
doi:10.1016/j.scico.2013.10.009 fatcat:rft2mq6z6zhulc6eetgbxuuuii

Theoretical and Practical Approaches for Hardness Amplification of PUFs [article]

Fatemeh Ganji, Shahin Tajik, Pascal Stauss, Jean-Pierre Seifert, Domenic Forte, Mark Mohammad Tehranipoor
2019 IACR Cryptology ePrint Archive  
In the lack of systematic and provable methods for this purpose, we have witnessed the ever-continuing competition between PUF designers/ manufacturers, cryptanalysts, and of course, adversaries that maliciously  ...  Based on what can be learned from this and central insights provided by the ML and complexity theory, we propose a new PUF-based scheme built around the idea of using a new function, namely, the Tribes  ...  For constructing a PUF with a 64-bit challenge, 64 of these modules are chained in series.  ... 
dblp:journals/iacr/GanjiTSSFT19 fatcat:yx6rbxabsraxdntxh67e4irjxm

Subject Index to Volumes 1–75

2001 Information Processing Letters  
, 3708 length of a longest path, 1828 shortest path, 505, 815, 816, 3985 length of the longest cycle, 3048 edge, 1254 string, 112 length of the word chain, 1959 word chains, 1462, 1959 length  ...  , 50 shortest, 367 addition chain, 1118 addition/subtraction chain, 1118 alternating path, 1185 and quickest path, 2826 average length, 1497 closed walk, 1705 shortest common supersequence, 2170  ...  constructibility, 3182 detection, 1387 range join, 2933 algorithm, 2933 range of a function, 3993 values, 744 range query, 153, 791, 859, 939, 1304, 1387, 1435, 1658, 1761, 1908, 2235, 2836 querying,  ... 
doi:10.1016/s0020-0190(01)00175-2 fatcat:5y67tfm6yfbblakrus5nnhs73e

On Redundancy in Constraint Satisfaction Problems

Clément Carbonnel, Christine Solnon
A constraint language Γ has non-redundancy f(n) if every instance of CSP(Γ) with n variables contains at most f(n) non-redundant constraints.  ...  In general, the non-redundancy of constraint languages is poorly understood and little is known beyond the trivial bounds Ω(n) and O(n^r).  ...  been devoted to designing systems that can learn CSPs with as few queries as possible.  ... 
doi:10.4230/lipics.cp.2022.11 fatcat:eupjcv4vvfa4nnsjh3acpnpnx4

Bachelor Thesis Development and Deployment of a Perception Stack for the Formula Student Driverless Competition

Cedric Perauer
with GPU acceleration.  ...  Building on competitive teams' work from the first few Formula Student Driverless events, this thesis proposes a lidar and camera pipeline for real-time detection of the track limits on an embedded device  ...  As a result of this, the length N of queries limits the maximum amount of bounding boxes that can be predicted.  ... 
doi:10.6084/m9.figshare.14188883.v1 fatcat:lqeayovsdvdrrlogmi243olcm4

Tunable Security for Deployable Data Outsourcing

Jens Köhler
To cope with such trade-offs, it is preferable to build approaches that allow to tune the trade-offs after the implementation and design phase.  ...  The book shows how the proposed methodology can be applied in the domains of database outsourcing, identity management, and credential management.  ...  Signature aggregation and chaining techniques [MNT06, NT06] can be used to enforce correctness and completeness.  ... 
doi:10.5445/ksp/1000048084 fatcat:vv2royigmbe2vhvp4muklxnchm

Metrics in automotive software development: A systematic literature review

Martin Vogel, Peter Knapik, Moritz Cohrs, Bernd Szyperrek, Winfried Pueschel, Haiko Etzel, Daniel Fiebig, Andreas Rausch, Marco Kuhrmann
2020 Journal of Software: Evolution and Process  
Most of the metrics are concerned with source code, are generic, and not specifically designed for automotive software development.  ...  Yet, problems with assigning metrics to quality attributes often occur in practice.  ...  to select metrics aligned with the available development tool chain is missing.  ... 
doi:10.1002/smr.2296 fatcat:4ga4f4us7rgwley5t3xpfz2e6e

Hardware entangled security primitives: attacks and defenses

Shaza Zeitouni
, runtime protection, trusted execution and trusted configuration, to name some.  ...  cryptographic key generation, and ii) a defensive part, where we present our novel hardware-assisted defenses/architectures for platform integrity at runtime and trusted configuration that are based on  ...  This work was supported by the German Science Foundation CRC 1119 CROSSING P3, the German Federal Ministry of Education and Research (BMBF)  ... 
doi:10.26083/tuprints-00021552 fatcat:o4ipw2tpabdyjjmw54n4o3w32e
« Previous Showing results 1 — 15 out of 48 results