Filters








10,384 Hits in 10.3 sec

Depth-d Threshold Circuits vs. Depth-(d + 1) AND-OR Trees [article]

Pooya Hatami, William Hoza, Avishay Tal, Roei Tell
2022 Electronic colloquium on computational complexity  
tree of depth d + 1 maintains structure.  ...  We show that under a modified version of their projection procedure, any depth-d threshold circuit with n 1+γ wires simplifies to a near-trivial function, whereas an appropriately parameterized AND-OR  ...  The optimal size complexity of depth-d LTF circuits computing our depth-(d + 1) AND-OR tree F (n) d+1 remains unclear.  ... 
dblp:journals/eccc/HatamiHTT22 fatcat:ncpjke6zdncvznw4keppv5hdeq

Efficient Sample Delay Calculation for 2-D and 3-D Ultrasound Imaging

Aya Ibrahim, Pascal A. Hager, Andrea Bartolini, Federico Angiolini, Marcel Arditi, Jean-Philippe Thiran, Luca Benini, Giovanni De Micheli
2017 IEEE Transactions on Biomedical Circuits and Systems  
Unfortunately, advanced 3D systems require the calculation or storage of billions of such delay values per frame, which is a challenge.  ...  To quantify their hardware cost, we implement them on FPGA and study their footprint and performance.  ...  For convenience of illustration, we show a very generic beamforming circuit in Fig. 1 Fig. 1 .  ... 
doi:10.1109/tbcas.2017.2673547 pmid:28574367 fatcat:4izouklhb5bmpm6cb6wtpbpmse

D-KODE: Mechanism to Generate and Maintain a Billion Keys [article]

Easwar Vivek Mangipudi, Aniket Kate
2022 IACR Cryptology ePrint Archive  
This work presents a Keys-On-Demand (D-KODE) 1 distributed protocol suite that lets the blockchain system securely generate the public key of any Bob against a mobile, threshold adversary.  ...  The existing solutions for the first problem need Bob to either generate and maintain private keys locally for the first time in his life-a usability bottleneck-or place trust in third-party custodial  ...  ACKNOWLEDGEMENTS We thank Leonard Tan and Zhen Yu of Torus for the discussions and feedback regarding key management in cryptocurrency wallets.  ... 
dblp:journals/iacr/MangipudiK22 fatcat:agelj5hkpvformpsizi4hdmp7u

Lower Bounds Against Weakly-Uniform Threshold Circuits

Ruiwen Chen, Valentine Kabanets, Jeff Kinne
2013 Algorithmica  
fan-in AND, OR and MOD m gates, for any integer m > 1.  ...  For example, we show that Permanent is not computable by polynomial-size (log n) O(1) -weakly-uniform threshold circuits of depth o(log log n), generalizing the result by Koiran and Perifel [KP09].  ...  Council grants #11-07 and #12-18.  ... 
doi:10.1007/s00453-013-9823-y fatcat:qhysc73akvgzjgzdxl5d5ymula

Small-scale characterization of vine plant root water uptake via 3-D electrical resistivity tomography and mise-à-la-masse method

Benjamin Mary, Luca Peruzzo, Jacopo Boaga, Myriam Schmutz, Yuxin Wu, Susan S. Hubbard, Giorgio Cassiani
2018 Hydrology and Earth System Sciences  
Evidence from field data, showing that voltage distribution is very different whether current is injected into the tree stem or in the ground, strongly supports this hypothesis.  ...  We tested the proposed procedure on synthetic data and, more importantly, on field data collected in a vineyard, where the estimated depth of the root zone proved to be in agreement with literature on  ...  , sunny vs. cloudy days) and seasonally (growth period vs. winter or drought season).  ... 
doi:10.5194/hess-22-5427-2018 fatcat:3gtrkj7nancazjuez7s7r3kv3q

RGB-D Data-Based Action Recognition: A Review

Muhammad Bilal Shaikh, Douglas Chai
2021 Sensors  
In this paper, we focus solely on data fusion and recognition techniques in the context of vision with an RGB-D perspective.  ...  Naturally, each action-data modality—such as RGB, depth, skeleton, and infrared (IR)—has distinct characteristics; therefore, it is important to exploit the value of each modality for better action recognition  ...  All statements of fact, opinion, or conclusions contained herein are those of the authors and should not be construed as representing the official views or policies of the sponsors.  ... 
doi:10.3390/s21124246 fatcat:7dvocdy63rckne5yunhfsnr4p4

New Bounds for Energy Complexity of Boolean Functions [chapter]

Krishnamoorthy Dinesh, Samir Otiv, Jayalal Sarma
2018 Lecture Notes in Computer Science  
For a Boolean function f : {0, 1} n → {0, 1} computed by a circuit C over a finite basis B, the energy complexity of C (denoted by EC B (C)) is the maximum over all inputs {0, 1} n the numbers of gates  ...  of the circuit C (excluding the inputs) that output a one.  ...  A decision tree is a rooted tree with all the non-leaf nodes labeled by variables and leaves labeled by a 0 or 1.  ... 
doi:10.1007/978-3-319-94776-1_61 fatcat:5qjhgjwgi5ahfet5gez3256sai

New Bounds for Energy Complexity of Boolean Functions [article]

Krishnamoorthy Dinesh, Samir Otiv, Jayalal Sarma
2020 arXiv   pre-print
tree depth of f. * We define a parameter positive sensitivity (denoted by ), a quantity that is smaller than sensitivity and defined in a similar way, and show that for any Boolean circuit C computing  ...  (F) ) where L(F) is the size and depth(F) is the depth of a formula F.  ...  [SW93] showed that for any unbounded fan-in circuit C of depth d computing ⊕ n , negs(C) ≥ d( n/2 ) 1/dd.  ... 
arXiv:1808.07199v2 fatcat:ddq3tbnu3zdaxn24cnn3glpjm4

Schema Validation via Streaming Circuits

Filip Murlak, Charles Paperman, Michał Pilipczuk
2016 Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems - PODS '16  
circuits of depth logarithmic in the block size, or even constant under certain assumptions on the input schema.  ...  XML schema validation can be performed in constant memory in the streaming model if and only if the schema admits only trees of bounded depth-a mild assumption from the practical view-point.  ...  of the flattenings of trees of depth at most d1, tree d (x, y) := a∈Σ a(x) ∧ a(y) ∧ forest d1 (x, y) .  ... 
doi:10.1145/2902251.2902299 dblp:conf/pods/MurlakPP16 fatcat:fyhi5ck7mbfrden7qj3lv4iqqu

Page 5365 of Mathematical Reviews Vol. , Issue 94i [page]

1994 Mathematical Reviews  
An extension of this construction is used to prove that whatever can be computed by a depth d polynomial size threshold circuit with weights can be computed by a depth d+ 1 polynomial size unweighted threshold  ...  Summary: “In this paper we study small depth circuits that contain threshold gates (with or without weights) and parity gates. All circuits we consider are of polynomial size.  ... 

Monotone Circuits for the Majority Function [chapter]

Shlomo Hoory, Avner Magen, Toniann Pitassi
2006 Lecture Notes in Computer Science  
At last, we show that the size can be further reduced at the expense of increased depth, and obtain a circuit for the majority of size and depth about n 1· Ô 2 and 9 9 logn.  ...  We present a simple randomized construction of size O´n 3 µ and depth 5 3 log n · O´1µ monotone circuits for the majority function on n variables.  ...  Let H k be the depth 2k binary tree with alternating layers of AND and OR gates, where the root is labeled OR.  ... 
doi:10.1007/11830924_38 fatcat:7rrfguosr5fndfrjpy5szaybsy

Page 8078 of Mathematical Reviews Vol. , Issue 98M [page]

1998 Mathematical Reviews  
.” 98m:68092 68Q15 03D15 Kreidler, Martin (D-K_LRH-PR; Karlsruhe); Seese, Detlef (D-K LRH-PR; Karlsruhe) Monadic NP and built-in trees.  ...  “We show that reliable computation is impossible for and/or- circuits and threshold circuits with unknown error probabilities. Gates with large fanin are of no use in this case.  ... 

Hardness Amplification and the Approximate Degree of Constant-Depth Circuits [chapter]

Mark Bun, Justin Thaler
2015 Lecture Notes in Computer Science  
Our techniques also yield a new lower bound of Ω n 1/2 / log (d−2)/2 (n) on the approximate degree of the AND-OR tree of depth d, which is tight up to polylogarithmic factors for any constant d, as well  ...  Curiously, Theorem 1 is nonetheless a critical ingredient in our proof of a direct-sum type theorem for AND-OR trees of constant depth (Theorem 8). Proof Idea.  ...  We are grateful to Sasha Sherstov, RobertŠpalek, Li-Yang Tan, and the anonymous reviewers for valuable feedback on earlier versions of this manuscript.  ... 
doi:10.1007/978-3-662-47672-7_22 fatcat:2mwvmc5i6bgqrogbnxstlw6s2a

Hardness Amplification and the Approximate Degree of Constant-Depth Circuits [article]

Mark Bun, Justin Thaler
2014 arXiv   pre-print
Our techniques also yield a new lower bound of Ω(n^1/2/^(d-2)/2(n)) on the approximate degree of the AND-OR tree of depth d, which is tight up to polylogarithmic factors for any constant d, as well as  ...  previous best results of (-Ω(n^1/3)) and (Ω(n^1/3)) respectively.  ...  We are grateful to Sasha Sherstov, RobertŠpalek, Li-Yang Tan, and the anonymous reviewers for valuable feedback on earlier versions of this manuscript.  ... 
arXiv:1311.1616v4 fatcat:rceo2wvdojeeleoy46najz47ou

A Neutral Rewrite Mutation Operator for Genetic Programming applied to Boolean Domain Problems

Dmytro Vitel, Alessio Gaspar, Paul Wiegand
2021 Proceedings of the ... International Florida Artificial Intelligence Research Society Conference  
The effect of semantically neutral tree rewrites is analyzed in the context of genetic programming applied to Boolean domain problems.  ...  E = {(x, (n or not n) and x), (x, (n and not n) or x)} D = A * basis ∪ A * DM ∪ A * a ∪ A d depth(n) = (d(s) > * n, reduce b ) missing ERC = (missingBusBit(n), expand b )) expand b = any({any-match(e)  ...  | e ∈ E}) default = ( , any({any-match(t) | t ∈ D})) str(n) = on({depth(n), missing ERC , default}) Case depth(n) applies reduce b when depth of target site s is greater than n (we assume that, for this  ... 
doi:10.32473/flairs.v34i1.128527 fatcat:zh3lgysljvgnhmvkjhnbvonnde
« Previous Showing results 1 — 15 out of 10,384 results