Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
39 | Rada Chirkova, Chen Li 0001, Jia Li |
Answering queries using materialized views with minimum size. |
VLDB J. |
2006 |
DBLP DOI BibTeX RDF |
Minimum-size viewsets, Distributed systems, Data warehouses, Views |
32 | Joseph Cheriyan, Ramakrishna Thurimella |
Approximating Minimum-Size k-Connected Spanning Subgraphs via Matching (extended abstract). |
FOCS |
1996 |
DBLP DOI BibTeX RDF |
minimum-size, k-connected spanning subgraphs, k-NCSS, k-ECSS, graph theory, heuristic, matching, undirected graphs |
25 | Byung Kook Kim, Kang G. Shin |
Scalable hardware earliest-deadline-first scheduler for ATM switching networks. |
RTSS |
1997 |
DBLP DOI BibTeX RDF |
scalable hardware earliest deadline first link scheduler, ATM switching networks, fast hardware solution, switching speed, minimum size EDF priority queue, variable size FIFO queues, two port memory buffer, deadline folding technique, deadline resolution, asynchronous transfer mode, real time scheduler, simulation studies, EDF scheduler, clock cycles |
23 | Issam S. Abu-Khater, Abdellatif Bellaouar, Mohamed I. Elmasry, Ran-Hong Yan |
Circuit/architecture for low-power high-performance 32-bit adder. |
Great Lakes Symposium on VLSI |
1995 |
DBLP DOI BibTeX RDF |
conditional sum architecture, CPL-like logic implementation, power supply voltage, minimum size, optimized speed, 1 to 3.3 V, logic design, CMOS, integrated circuit design, adders, adder, CMOS logic circuits, circuit optimisation, 32 bit |
23 | Kazuo Iwama, Hiroki Morizumi, Jun Tarui |
Negation-Limited Complexity of Parity and Inverters. |
Algorithmica |
2009 |
DBLP DOI BibTeX RDF |
Negation-limited circuit, Parity function, Inversion complexity, Gate elimination, Circuit complexity, Inverter |
23 | Kazuo Iwama, Hiroki Morizumi, Jun Tarui |
Negation-Limited Complexity of Parity and Inverters. |
ISAAC |
2006 |
DBLP DOI BibTeX RDF |
|
22 | Piotr Krysta, V. S. Anil Kumar 0001 |
Approximation Algorithms for Minimum Size 2-Connectivity Problems. |
STACS |
2001 |
DBLP DOI BibTeX RDF |
|
19 | Ali Dehghan 0001, Amir H. Banihashemi |
From Cages to Trapping Sets and Codewords: A Technique to Derive Tight Upper Bounds on the Minimum Size of Trapping Sets and Minimum Distance of LDPC Codes. |
IEEE Trans. Inf. Theory |
2019 |
DBLP DOI BibTeX RDF |
|
19 | Ali Dehghan 0001, Amir H. Banihashemi |
From Cages to Trapping Sets: A New Technique to Derive Tight Upper Bounds on the Minimum Size of Trapping Sets and Minimum Distance of LDPC Codes. |
ISIT |
2018 |
DBLP DOI BibTeX RDF |
|
19 | Ali Dehghan 0001, Amir H. Banihashemi |
From Cages to Trapping Sets and Codewords: A Technique to Derive Tight Upper Bounds on the Minimum Size of Trapping Sets and Minimum Distance of LDPC Codes. |
CoRR |
2017 |
DBLP BibTeX RDF |
|
19 | Weihua Yang, Yingzhi Tian, Hengzhe Li, Hao Li, Xiaofeng Guo |
The minimum restricted edge-connected graph and the minimum size of graphs with a given edge-degree. |
Discret. Appl. Math. |
2014 |
DBLP DOI BibTeX RDF |
|
19 | Ronald J. Gould, John R. Schmitt |
Minimum degree and the minimum size of K22-saturated graphs. |
Discret. Math. |
2007 |
DBLP DOI BibTeX RDF |
|
19 | Yuanzhu Peter Chen, Arthur L. Liestman |
Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks. |
MobiHoc |
2002 |
DBLP DOI BibTeX RDF |
weakly-connected dominating set, clustering, ad hoc network, distributed algorithm, dominating set |
17 | Liming Zhao, Aline Normoyle, Sanjeev Khanna, Alla Safonova |
Automatic construction of a minimum size motion graph. |
Symposium on Computer Animation |
2009 |
DBLP DOI BibTeX RDF |
|
17 | Gerzson Kéri, Patric R. J. Östergård |
On the minimum size of binary codes with length 2 R + 4 and covering radius R. |
Des. Codes Cryptogr. |
2008 |
DBLP DOI BibTeX RDF |
AMS Classifications 94B75, 94B65, 94B25 |
17 | Pablo Moisset de Espanés, Ashish Goel |
Toward minimum size self-assembled counters. |
Nat. Comput. |
2008 |
DBLP DOI BibTeX RDF |
Algorithmic self-assembly, Complexity, Nanotechnology, Exhaustive search, Counters |
17 | José L. Balcázar |
Minimum-Size Bases of Association Rules. |
ECML/PKDD (1) |
2008 |
DBLP DOI BibTeX RDF |
optimum bases, association rules, redundancy |
17 | Ashish Goel, Pablo Moisset de Espanés |
Toward Minimum Size Self-Assembled Counters. |
DNA |
2007 |
DBLP DOI BibTeX RDF |
|
15 | Jon M. Kleinberg, Mark Sandler 0002, Aleksandrs Slivkins |
Network failure detection and graph connectivity. |
SODA |
2004 |
DBLP BibTeX RDF |
|
15 | Edwin D. de Jong, Jordan B. Pollack |
Multi-Objective Methods for Tree Size Control. |
Genet. Program. Evolvable Mach. |
2003 |
DBLP DOI BibTeX RDF |
variable size representations, Genetic programming, multi-objective optimization, interpretability, Pareto optimality, bloat, code growth |
15 | Sang Ho Lee, Kyu-Young Whang, Yang-Sae Moon, Il-Yeol Song |
Dynamic Buffer Allocation in Video-on-Demand Systems. |
SIGMOD Conference |
2001 |
DBLP DOI BibTeX RDF |
|
15 | Michael Langberg, Alexander Sprintson, Jehoshua Bruck |
The encoding complexity of network coding. |
IEEE Trans. Inf. Theory |
2006 |
DBLP DOI BibTeX RDF |
coding networks, encoding links, encoding nodes, multicast, network coding |
15 | Irith Pomeranz, Zvi Kohavi |
The minimum test set problem for circuits with nonreconvergent fanout. |
J. Electron. Test. |
1991 |
DBLP DOI BibTeX RDF |
minimum test set size problem, nonreconvergent fanout circuits, restricted fanout circuits, Labeling algorithms |
14 | Sang Ho Lee, Kyu-Young Whang, Yang-Sae Moon, Wook-Shin Han, Il-Yeol Song |
Dynamic Buffer Allocation in Video-on-Demand Systems. |
IEEE Trans. Knowl. Data Eng. |
2003 |
DBLP DOI BibTeX RDF |
VOD systems, dynamic buffer allocation, buffer scheduling methods, multimedia systems |
13 | Eduardo Sany Laber, Lucas Murtinho |
Optimization of Inter-group Criteria for Clustering with Minimum Size Constraints. |
CoRR |
2024 |
DBLP DOI BibTeX RDF |
|
13 | Vito Napolitano, Olga Polverino, Paolo Santonastaso, Ferdinando Zullo |
Classifications and constructions of minimum size linear sets on the projective line. |
Finite Fields Their Appl. |
2023 |
DBLP DOI BibTeX RDF |
|
13 | Christian Bessiere, Clément Carbonnel, Martin C. Cooper, Emmanuel Hebrard |
Complexity of minimum-size arc-inconsistency explanations. |
Constraints An Int. J. |
2023 |
DBLP DOI BibTeX RDF |
|
13 | Gangsan Kim, Hyojeong Choi, Daekyeong Kim, Won Jun Kim, Xiaoxiang Jin, Hong-Yeop Song |
Optimal Uncorrelated Polyphase ZCZ Sequences over an Alphabet of Minimum size. |
ISIT |
2023 |
DBLP DOI BibTeX RDF |
|
13 | Eduardo Sany Laber, Lucas Murtinho |
Optimization of Inter-group criteria for clustering with minimum size constraints. |
NeurIPS |
2023 |
DBLP BibTeX RDF |
|
13 | Azzam Habib |
Performance evaluation of approximation algorithms for the minimum size 2-vertex strongly connected subgraph problem. |
CoRR |
2022 |
DBLP DOI BibTeX RDF |
|
13 | Alessandro Epasto, Mohammad Mahdian, Vahab S. Mirrokni, Peilin Zhong |
Massively Parallel and Dynamic Algorithms for Minimum Size Clustering. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
13 | Stephen R. Tate, Bo Yuan |
Minimum Size Build Environment Sets and Graph Coloring. |
ICSOFT |
2022 |
DBLP DOI BibTeX RDF |
|
13 | Christian Bessiere, Clément Carbonnel, Martin C. Cooper, Emmanuel Hebrard |
Complexity of Minimum-Size Arc-Inconsistency Explanations. |
CP |
2022 |
DBLP DOI BibTeX RDF |
|
13 | Zemin Jin, Bin Sheng 0002, Yuefang Sun |
The minimum size of a graph with given tree connectivity. |
Discuss. Math. Graph Theory |
2021 |
DBLP DOI BibTeX RDF |
|
13 | Tibor Jordán |
Minimum Size Highly Redundantly Rigid Graphs in the Plane. |
Graphs Comb. |
2021 |
DBLP DOI BibTeX RDF |
|
13 | Alessandro Epasto, Mohammad Mahdian, Vahab S. Mirrokni, Peilin Zhong |
Massively Parallel and Dynamic Algorithms for Minimum Size Clustering. |
CoRR |
2021 |
DBLP BibTeX RDF |
|
13 | Dibyayoti Jena, Geertrui Van de Voorde |
On linear sets of minimum size. |
Discret. Math. |
2021 |
DBLP DOI BibTeX RDF |
|
13 | Fangli Ma, Yang Xu 0001, Peng Xu |
Research on the Minimum Size of Received Signal Strength Difference Localization Network. |
Int. J. Comput. Intell. Syst. |
2021 |
DBLP DOI BibTeX RDF |
|
13 | Andrzej Rucinski 0001, Andrzej Zak |
On the Minimum Size of Hamilton Saturated Hypergraphs. |
Electron. J. Comb. |
2020 |
DBLP DOI BibTeX RDF |
|
13 | Yan Zhao |
More on the minimum size of graphs with given rainbow index. |
Discuss. Math. Graph Theory |
2020 |
DBLP DOI BibTeX RDF |
|
13 | Bart De Bruyn, Puspendu Pradhan, Binod Kumar Sahoo |
Minimum size blocking sets of certain line sets with respect to an elliptic quadric in PG(3, q). |
Contributions Discret. Math. |
2020 |
DBLP BibTeX RDF |
|
13 | Pavel Shcherbakov 0001 |
Finding Minimum-Size Ellipsoids Covering a Subset of Points: Several Simple Heuristic Approaches. |
CoDIT |
2020 |
DBLP DOI BibTeX RDF |
|
13 | Bart De Bruyn, Binod Kumar Sahoo |
On minimum size blocking sets of the outer tangents to a hyperbolic quadric in PG(3, q). |
Finite Fields Their Appl. |
2019 |
DBLP DOI BibTeX RDF |
|
13 | Gabriel Torrens, Bartomeu Alorda, Cristian Carmona, Daniel Malagón-Periánez, Jaume Segura 0001, Sebastià A. Bota |
A 65-nm Reliable 6T CMOS SRAM Cell with Minimum Size Transistors. |
IEEE Trans. Emerg. Top. Comput. |
2019 |
DBLP DOI BibTeX RDF |
|
13 | Ahad N. Zehmakan |
Tight Bounds on the Minimum Size of a Dynamic Monopoly. |
CoRR |
2019 |
DBLP BibTeX RDF |
|
13 | Jan De Beule, Geertrui Van de Voorde |
The minimum size of a linear set. |
J. Comb. Theory, Ser. A |
2019 |
DBLP DOI BibTeX RDF |
|
13 | Ahad N. Zehmakan |
Tight Bounds on the Minimum Size of a Dynamic Monopoly. |
LATA |
2019 |
DBLP DOI BibTeX RDF |
|
13 | Nathann Cohen, Frédéric Havet |
On the Minimum Size of an Identifying Code Over All Orientations of a Graph. |
Electron. J. Comb. |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Qing Yang, Zengtai You, Xinshang You |
A Note on the Minimum Size of a Point Set Containing Three Nonintersecting Empty Convex Polygons. |
Symmetry |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Sang Won Bae, Hwan-Gue Cho, William S. Evans, Noushin Saeedi, Chan-Su Shin |
Covering points with convex sets of minimum size. |
Theor. Comput. Sci. |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Bi Li 0004, Fatima Zahra Moataz, Nicolas Nisse, Karol Suchan |
Minimum size tree-decompositions. |
Discret. Appl. Math. |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Adam S. Jobson, André E. Kézdy, Jeno Lehel |
The minimum size of graphs satisfying cut conditions. |
Discret. Appl. Math. |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Luis Barba, Frank Duque, Ruy Fabila Monroy, Carlos Hidalgo-Toscano |
Drawing the Horton set in an integer grid of minimum size. |
Comput. Geom. |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Frank Duque, Ruy Fabila Monroy, Carlos Hidalgo-Toscano, Pablo Pérez-Lantero |
Drawing the almost convex set in an integer grid of minimum size. |
Comput. Geom. |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Seyed MohammadReza Hosseini, Mohammad Ali Sebt |
Array Interpolation Using Covariance Matrix Completion of Minimum-Size Virtual Array. |
IEEE Signal Process. Lett. |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Tom Kelly 0001, Chun-Hung Liu |
Minimum size of feedback vertex sets of planar graphs of girth at least five. |
Eur. J. Comb. |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Esmeralda Nastase, Papa A. Sissokho |
The structure of the minimum size supertail of a subspace partition. |
Des. Codes Cryptogr. |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Mathieu Chapelle, Manfred Cochefert, Dieter Kratsch, Romain Letourneur, Mathieu Liedloff |
Exact exponential algorithms to find tropical connected sets of minimum size. |
Theor. Comput. Sci. |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Philippe Legault |
An Upper Bound of 7n/6 for the Minimum Size 2EC on Cubic 3-Edge Connected Graphs. |
CoRR |
2017 |
DBLP BibTeX RDF |
|
13 | Andrew White |
A Model-Based Analysis of the Minimum Size of Demographically-Viable Hunter-Gatherer Populations. |
J. Artif. Soc. Soc. Simul. |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Chuanwen Luo, Yongcai Wang, Jiguo Yu, Wenping Chen, Deying Li 0001 |
A New Greedy Algorithm for Constructing the Minimum Size Connected Dominating Sets in Wireless Networks. |
WASA |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Ilya Zakirzyanov, Anatoly Shalyto 0001, Vladimir Ulyantsev |
Finding All Minimum-Size DFA Consistent with Given Examples: SAT-Based Approach. |
SEFM Workshops |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Andrzej Rucinski 0001, Andrzej Zak |
Upper Bounds on the Minimum Size of Hamilton Saturated Hypergraphs. |
Electron. J. Comb. |
2016 |
DBLP DOI BibTeX RDF |
|
13 | Frank Duque, Ruy Fabila Monroy, Carlos Hidalgo-Toscano, Pablo Pérez-Lantero |
Drawing the Almost Convex Set in an Integer Grid of Minimum Size. |
CoRR |
2016 |
DBLP BibTeX RDF |
|
13 | M. Boostan, Somayyeh Golalizadeh, Nasrin Soltankhah |
Super-simple (v, 4, 2) directed designs and a lower bound for the minimum size of their defining set. |
Discret. Appl. Math. |
2016 |
DBLP DOI BibTeX RDF |
|
13 | Kamal Lochan Patra, Binod Kumar Sahoo, Bikramaditya Sahu |
Minimum size blocking sets of certain line sets related to a conic in PG(2, q). |
Discret. Math. |
2016 |
DBLP DOI BibTeX RDF |
|
13 | Hwan-Gue Cho, William S. Evans, Noushin Saeedi, Chan-Su Shin |
Covering Points with Convex Sets of Minimum Size. |
WALCOM |
2016 |
DBLP DOI BibTeX RDF |
|
13 | Bi Li 0004, Fatima Zahra Moataz, Nicolas Nisse, Karol Suchan |
Minimum Size Tree-decompositions. |
Electron. Notes Discret. Math. |
2015 |
DBLP DOI BibTeX RDF |
|
13 | Béla Bajnok, Ryan Matzke |
The Minimum Size of Signed Sumsets. |
Electron. J. Comb. |
2015 |
DBLP DOI BibTeX RDF |
|
13 | Luis Barba, Frank Duque, Ruy Fabila Monroy, Carlos Hidalgo-Toscano |
Drawing the Horton Set in an Integer Grid of Minimum Size. |
CoRR |
2015 |
DBLP BibTeX RDF |
|
13 | Michael A. Henning, Justin Southey |
A characterization of the non-trivial diameter two graphs of minimum size. |
Discret. Appl. Math. |
2015 |
DBLP DOI BibTeX RDF |
|
13 | Yiping Lu 0002, Jianzhong Cha |
A fast algorithm for identifying minimum size instances of the equivalence classes of the Pallet Loading Problem. |
Eur. J. Oper. Res. |
2014 |
DBLP DOI BibTeX RDF |
|
13 | Patric R. J. Östergård |
On the minimum size of 4-uniform hypergraphs without property B. |
Discret. Appl. Math. |
2014 |
DBLP DOI BibTeX RDF |
|
13 | Olof Heden, Juliane Lehmann, Esmeralda Nastase, Papa A. Sissokho |
On the type(s) of minimum size subspace partitions. |
Discret. Math. |
2014 |
DBLP DOI BibTeX RDF |
|
13 | Allan Lo |
A note on the minimum size of k-rainbow-connected graphs. |
Discret. Math. |
2014 |
DBLP DOI BibTeX RDF |
|
13 | Sergey Bereg, Ruy Fabila Monroy, David Flores-Peñaloza, Mario Alberto López, Pablo Pérez-Lantero |
Embedding the double Circle in a Square Grid of Minimum Size. |
Int. J. Comput. Geom. Appl. |
2014 |
DBLP DOI BibTeX RDF |
|
13 | Mathieu Chapelle, Manfred Cochefert, Dieter Kratsch, Romain Letourneur, Mathieu Liedloff |
Exact Exponential Algorithms to Find a Tropical Connected Set of Minimum Size. |
IPEC |
2014 |
DBLP DOI BibTeX RDF |
|
13 | Andrzej Rucinski 0001, Andrzej Zak |
Hamilton Saturated Hypergraphs of Essentially Minimum Size. |
Electron. J. Comb. |
2013 |
DBLP DOI BibTeX RDF |
|
13 | Thomas Kalinowski, Uwe Leck, Ian T. Roberts |
Maximal Antichains of Minimum Size. |
Electron. J. Comb. |
2013 |
DBLP DOI BibTeX RDF |
|
13 | Roberto Fontana |
Algebraic generation of minimum size orthogonal fractional factorial designs: an approach based on integer linear programming. |
Comput. Stat. |
2013 |
DBLP DOI BibTeX RDF |
|
13 | Sergey Bereg, Ruy Fabila Monroy, David Flores-Peñaloza, Mario Alberto López, Pablo Pérez-Lantero |
Drawing the double circle on a grid of minimum size |
CoRR |
2013 |
DBLP BibTeX RDF |
|
13 | Zbigniew Lonc, Karolina Warno |
Minimum size transversals in uniform hypergraphs. |
Discret. Math. |
2013 |
DBLP DOI BibTeX RDF |
|
13 | Jens-P. Bode, Heiko Harborth |
The minimum size of kk-rainbow connected graphs of given order. |
Discret. Math. |
2013 |
DBLP DOI BibTeX RDF |
|
13 | Nathaniel Johnston |
The Minimum Size of Qubit Unextendible Product Bases. |
TQC |
2013 |
DBLP DOI BibTeX RDF |
|
13 | Bing-Hong Liu, Yue-Xian Lin, Wei-Sheng Wang, Chih-Yuan Lien |
A Modified Method for Constructing Minimum Size Homogeneous Wireless Sensor Networks with Relay Nodes to Fully Cover Critical Square Grids. |
ICGEC |
2013 |
DBLP DOI BibTeX RDF |
|
13 | Ruoyu Xu, Bing Liu 0012, George Jie Yuan |
Digitally Calibrated 768-kS/s 10-b Minimum-Size SAR ADC Array With Dithering. |
IEEE J. Solid State Circuits |
2012 |
DBLP DOI BibTeX RDF |
|
13 | Zan-Bo Zhang, Xiaoyan Zhang 0001, Dingjun Lou, Xuelian Wen |
Minimum Size of n-Factor-Critical Graphs and k-Extendable Graphs. |
Graphs Comb. |
2012 |
DBLP DOI BibTeX RDF |
|
13 | Bundit Laekhanukit, Shayan Oveis Gharan, Mohit Singh |
A Rounding by Sampling Approach to the Minimum Size k-Arc Connected Subgraph Problem |
CoRR |
2012 |
DBLP BibTeX RDF |
|
13 | Christian Damgaard |
Estimating plant allometric relationships in a power model with a minimum size of allocation. |
Ecol. Informatics |
2012 |
DBLP DOI BibTeX RDF |
|
13 | Jean-Luc Fouquet, Henri Thuillier, Jean-Marie Vanherpe, A. Pawel Wojda |
On (Kq, k) vertex stable graphs with minimum size. |
Discret. Math. |
2012 |
DBLP DOI BibTeX RDF |
|
13 | Bundit Laekhanukit, Shayan Oveis Gharan, Mohit Singh |
A Rounding by Sampling Approach to the Minimum Size k-Arc Connected Subgraph Problem. |
ICALP (1) |
2012 |
DBLP DOI BibTeX RDF |
|
13 | Wei-Chieh Ke, Bing-Hong Liu, Ming-Jer Tsai |
Efficient Algorithm for Constructing Minimum Size Wireless Sensor Networks to Fully Cover Critical Square Grids. |
IEEE Trans. Wirel. Commun. |
2011 |
DBLP DOI BibTeX RDF |
|
13 | Oleg Pikhurko |
The minimum size of 3-graphs without a 4-set spanning no or exactly three edges. |
Eur. J. Comb. |
2011 |
DBLP DOI BibTeX RDF |
|
13 | José L. Balcázar |
Redundancy, Deduction Schemes, and Minimum-Size Bases for Association Rules |
Log. Methods Comput. Sci. |
2010 |
DBLP BibTeX RDF |
|
13 | Jiguo Yu, Nannan Wang, Guanghui Wang 0002 |
Heuristic Algorithms for Constructing Connected Dominating Sets with Minimum Size and Bounded Diameter in Wireless Networks. |
WASA |
2010 |
DBLP DOI BibTeX RDF |
|
13 | Peter Dankelmann, Lutz Volkmann |
Minimum size of a graph or digraph of given radius. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
13 | Aneta Dudek, Malgorzata Zwonek |
(H, k) stable bipartite graphs with the minimum size. |
Discuss. Math. Graph Theory |
2009 |
DBLP DOI BibTeX RDF |
|
13 | Olivier Bodini |
On the Minimum Size of a Contraction-Universal Tree |
CoRR |
2009 |
DBLP BibTeX RDF |
|
13 | Ralph J. Faudree, Michael Ferrara, Ronald J. Gould, Michael S. Jacobson |
tKp-saturated graphs of minimum size. |
Discret. Math. |
2009 |
DBLP DOI BibTeX RDF |
|
13 | Manuel Carrasco-Robles, Luis Serrano |
A Novel Minimum-Size Activation Function and Its Derivative. |
IEEE Trans. Circuits Syst. II Express Briefs |
2009 |
DBLP DOI BibTeX RDF |
|