Hybrid intelligence aspects of programming in *AIDA algorithmic pictures
نویسندگان
چکیده
منابع مشابه
Algorithmic Aspects of Regularity
Szemer edi's celebrated regularity lemma proved to be a fundamental result in graph theory. Roughly speaking, his lemma states that any graph may be approximated by a union of a bounded number of bipartite graphs, each of which is`pseudorandom'. As later proved by Alon, Duke, Lefmann, RR odl, and Yuster, there is a fast deterministic algorithm for nding such an approximation, and therefore many...
متن کاملAlgorithmic Aspects of Boosting
We discuss algorithmic aspects of boosting techniques, such as Majority Vote Boosting [Fre95], AdaBoost [FS97], and MadaBoost [DW00a]. Considering a situation where we are given a huge amount of examples and asked to find some rule for explaining these example data, we show some reasonable algorithmic approaches for dealing with such a huge dataset by boosting techniques. Through this example, ...
متن کاملDetecting quasiconvexity: Algorithmic aspects
The main result of this paper states that for any group G with an automatic structure L with unique representatives one can construct a uniform partial algorithm which detects L-rational subgroups and gives their preimages in L. This provides a practical, not just theoretical, procedure for solving the occurrence problem for such subgroups. 1. Generalized word problem and rational structures on...
متن کاملAlgorithmic Aspects of Bipartite Graphs
We generalize previous work done by Donald J. Rose and Robert E. Tarjan [2], who developed efficient algorithms for use on directed graphs. This paper considers an edge elimination process on bipartite graphs, presenting several theorems which lead to an algorithm for computing the minimal fill-in of a given ordered graph.
متن کاملAlgorithmic Aspects of Lipschitz Functions
We characterize the variation functions of computable Lipschitz functions. We show that a real z is computably random if and only if every computable Lipschitz function is differentiable at z. Furthermore, a real z is Schnorr random if and only if every Lipschitz function with L1-computable derivative is differentiable at z. For the implications from left to right we rely on literature results....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Future Generation Computer Systems
سال: 2014
ISSN: 0167-739X
DOI: 10.1016/j.future.2013.12.031