Results 31 to 40 of about 335,187 (120)
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018 The approximate degree of a Boolean function $f(x_{1},x_{2},\ldots,x_{n})$ is the minimum degree of a real polynomial that approximates $f$ pointwise within $1/3$. Upper bounds on approximate degree have a variety of applications in learning theory, differential privacy, and algorithm design in general.
openaire +5 more sources
Lane Transformer: A High-Efficiency Trajectory Prediction Model
IEEE Open Journal of Intelligent Transportation Systems, 2023 Trajectory prediction is a crucial step in the pipeline for autonomous driving because it not only improves the planning of future routes, but also ensures vehicle safety.
Zhibo Wang +5 more
doaj +1 more source
, 2022 Why not have a computer just draw a map? This is something you hear a lot when people talk about gerrymandering, and it's easy to think at first that this could solve redistricting altogether. But there are more than a couple problems with this idea. In this chapter, two computer scientists survey what's been done in algorithmic redistricting, discuss ...
Amariah Becker, Justin Solomon 0001
openaire +3 more sources
Postmortem Analysis of Decayed Online Social Communities: Cascade Pattern Analysis and Prediction
Complexity, 2018 Recently, many online social networks, such as MySpace, Orkut, and Friendster, have faced inactivity decay of their members, which contributed to the collapse of these networks.
Mohammed Abufouda
doaj +1 more source
The Computer Journal, 1987 Algorithms are derived for allocating and deallocating blocks of memory using binary buddy, weighted buddy and variant weighted buddy partitioning; and transformations are demonstrated for converting recursive into non-recursive forms. Algorithms are given for the relatively difficult computation of the addressed and size of a buddy slot in the ...
D. J. Challab, J. D. Roberts
openaire +2 more sources
Weed Identification Using Deep Learning and Image Processing in Vegetable Plantation
IEEE Access, 2021 Weed identification in vegetable plantation is more challenging than crop weed identification due to their random plant spacing. So far, little work has been found on identifying weeds in vegetable plantation.
Xiaojun Jin, Jun Che, Yong Chen
doaj +1 more source
Analysis of Algorithms and Partial Algorithms [PDF]
, 2016 We present an alternative methodology for the analysis of algorithms, based on the concept of expected discounted reward. This methodology naturally handles algorithms that do not always terminate, so it can (theoretically) be used with partial algorithms for undecidable problems, such as those found in artificial general intelligence (AGI) and ...
openaire +3 more sources
Algorithmic thermodynamics [PDF]
Mathematical Structures in Computer Science, 2012 Algorithmic entropy can be viewed as a special case of the entropy studied in statistical mechanics. This viewpoint allows us to apply many techniques developed for use in thermodynamics to the subject of algorithmic information theory. In particular, suppose we fix a universal prefix-free Turing machine and letXbe the set of programs that halt for ...
John C. Baez, Mike Stay
openaire +5 more sources
Foggy Drone Teacher: Domain Adaptive Drone Detection Under Foggy Conditions
DronesWith the growing use of drones, efficient detection algorithms are crucial, especially under adverse weather conditions. Most existing drone detection algorithms perform well only in clear weather, resulting in significant performance drops in foggy ...
Guida Zheng +5 more
doaj +1 more source
Algorithms, Algorithms, Algorithms [PDF]
Computer, 2020 James Bret Michael, Jeffrey M. Voas
openaire +1 more source