Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
169 | Jiawei Han 0001, Ling Liu |
Efficient Evaluation of Multiple Linear Recursions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 17(12), pp. 1241-1252, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
multiple one sided linear recursions, multiple balanced K-sided recursions, multiple mixed K-sided recursion, side-coherent multiple linear recursions, single-linear recursive query evaluation, side-relation unioned processing, side-relation unioned transitive closure algorithm, side-relation unioned magic sets method, single-probe queries, information retrieval, database theory, deductive database, deductive databases, recursive functions |
105 | Xiaoyong Du 0001, Naohiro Ishii |
An Algebraic Rewriting Theorem of Multiple Linear Recursions and Its Applications ![Search on Bibsonomy](Pics/bibsonomy.png) |
DEXA ![In: Database and Expert Systems Applications, 6th International Conference, DEXA'95, London, United Kingdom, September 4-8, 1995, Proceedings, pp. 313-322, 1995, Springer, 3-540-60303-4. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
105 | Jeffrey F. Naughton |
One-Sided Recursions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODS ![In: Proceedings of the Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, March 23-25, 1987, San Diego, California, USA, pp. 340-348, 1987, ACM, 0-89791-223-3. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
91 | Jeffrey F. Naughton, Yehoshua Sagiv |
A Decidable Class of Bounded Recursions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODS ![In: Proceedings of the Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, March 23-25, 1987, San Diego, California, USA, pp. 227-236, 1987, ACM, 0-89791-223-3. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
77 | Ali Vakili, Babak Hassibi |
A Stieltjes transform approach for studying the steady-state behavior of random Lyapunov and Riccati recursions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CDC ![In: Proceedings of the 47th IEEE Conference on Decision and Control, CDC 2008, December 9-11, 2008, Cancún, Mexico, pp. 453-458, 2008, IEEE, 978-1-4244-3123-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
77 | Norman Danner, James S. Royer |
Time-Complexity Semantics for Feasible Affine Recursions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Computation and Logic in the Real World, Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007, Proceedings, pp. 205-217, 2007, Springer, 978-3-540-73000-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
77 | Xiaoyong Du 0001, Zhibin Liu, Naohiro Ishii |
Counting-Based Normalization for Multiple Linear Recursions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DEXA ![In: Database and Expert Systems Applications, 7th International Conference, DEXA '96, Zurich, Switzerland, September 9-13, 1996, Proceedings, pp. 554-563, 1996, Springer, 3-540-61656-X. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
69 | Yifeng Chen |
A Fixpoint Theory for Non-monotonic Parallelism. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 16th International Workshop, CSL 2002, 11th Annual Conference of the EACSL, Edinburgh, Scotland, UK, September 22-25, 2002, Proceedings, pp. 120-134, 2002, Springer, 3-540-44240-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
69 | Jiawei Han 0001, Ling Liu, Zhaohui Xie |
LogicBase: A Deductive Database System Prototype. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIKM ![In: Proceedings of the Third International Conference on Information and Knowledge Management (CIKM'94), Gaithersburg, Maryland, USA, November 29 - December 2, 1994, pp. 226-233, 1994, ACM. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
63 | George Petrides, Johannes Mykkeltveit |
Composition of recursions and nonlinear complexity of periodic binary sequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Des. Codes Cryptogr. ![In: Des. Codes Cryptogr. 49(1-3), pp. 251-264, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
AMS Classification 94A55 |
63 | Yatin P. Saraiya |
Linearizing Nonlinear Recursions in Polynomial Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODS ![In: Proceedings of the Eighth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, March 29-31, 1989, Philadelphia, Pennsylvania, USA, pp. 182-189, 1989, ACM Press, 0-89791-308-6. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
Datalog |
63 | Jeffrey F. Naughton |
Compiling Separable Recursions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMOD Conference ![In: Proceedings of the 1988 ACM SIGMOD International Conference on Management of Data, Chicago, Illinois, USA, June 1-3, 1988., pp. 312-319, 1988, ACM Press, 978-0-89791-268-6. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
55 | Arnon Rosenthal, Sandra Heiler, Umeshwar Dayal, Frank Manola |
Traversal Recursion: A Practical Approach to Supporting Recursive Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMOD Conference ![In: Proceedings of the 1986 ACM SIGMOD International Conference on Management of Data, Washington, DC, USA, May 28-30, 1986., pp. 166-176, 1986, ACM Press, 978-0-89791-191-7. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
|
49 | Emílio Del Moral Hernandez |
Bifurcating Pulsed Neural Networks, Chaotic Neural Networks and Parametric Recursions: Conciliating Different Frameworks in Neuro-Like Computing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCNN (6) ![In: Proceedings of the IEEE-INNS-ENNS International Joint Conference on Neural Networks, IJCNN 2000, Neural Computing: New Challenges and Perspectives for the New Millennium, Como, Italy, July 24-27, 2000, Volume 6, pp. 423-428, 2000, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
49 | Jiawei Han 0001, Qiang Wang |
Efficient Evaluation of Linear Recursions with Function Sysmbols in Deductive Databases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMIS ![In: Methodologies for Intelligent Systems, 6th International Symposium, ISMIS '91, Charlotte, N.C., USA, October 16-19, 1991, Proceedings, pp. 132-141, 1991, Springer, 3-540-54563-8. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
48 | Paul Fearnhead |
Filtering recursions for calculating likelihoods for queues based on inter-departure time data. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Stat. Comput. ![In: Stat. Comput. 14(3), pp. 261-266, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Er/G/1 queues, indirect inference, likelihood recursions, missing data, forward-backward algorithm, M/G/1 queues |
44 | Jiawei Han 0001 |
From transitive closure recursions to single-chain recursions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Syst. ![In: Inf. Syst. 15(4), pp. 479-488, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
41 | Norman Danner, James S. Royer |
Two Algorithms in Search of a Type-System. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 45(4), pp. 787-821, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Higher-type computation, Higher-type complexity, Basic feasible functionals, Compositional semantics, Implicit computational complexity |
41 | Yingxu Wang |
On the Big-R Notation for Describing Iterative and Recursive Behaviors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE ICCI ![In: Proceedings of the Firth IEEE International Conference on Cognitive Informatics, ICCI 2006, July 17-19, Beijing, China, pp. 132-140, 2006, IEEE Computer Society, 1-4244-0475-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
41 | Jiawei Han 0001 |
Compilation-Based List Processing in Deductive Databases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EDBT ![In: Advances in Database Technology - EDBT'92, 3rd International Conference on Extending Database Technology, Vienna, Austria, March 23-27, 1992, Proceedings, pp. 104-119, 1992, Springer, 3-540-55270-7. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
41 | Jiawei Han 0001 |
On the Power of Query-Independent Compilation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCI ![In: Advances in Computing and Information - ICCI'91, International Conference on Computing and Information, Ottawa, Canada, May 27-29, 1991, Proceedings, pp. 185-196, 1991, Springer, 3-540-54029-6. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
40 | Farn Wang |
Scalable compositional verification of high-level real-time concurrent systems from 107 to 1085 states. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTCSA ![In: Third International Workshop on Real-Time Computing Systems Application (RTCSA '96), October 30 - November 01, 1996, Seoul, Korea, pp. 106-, 1996, IEEE Computer Society, 0-8186-7626-4. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
scalable compositional verification, high-level real-time concurrent systems, compositional CTL mode-checking algorithm, discrete global clock, VERIFAST-2, truly scalable performance, software recursions, protocols, formal verification |
36 | A. B. Dieker, Marc Lelarge |
Tails for (max, plus) recursions under subexponentiality. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Queueing Syst. Theory Appl. ![In: Queueing Syst. Theory Appl. 53(4), pp. 213-230, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
(Max, plus) recursion, Open queueing network, Stochastic event graph, Resequencing delay, Subexponential distribution |
36 | Andrei P. Nemytykh |
A note on elimination of simplest recursions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASIA-PEPM ![In: Proceedings of the ACM SIGPLAN ASIA-PEPM 2002, Asian Symposium on Partial Evaluation and Semantics-Based Program Manipulation, Aizu, Japan, September 12-14, 2002, pp. 138-146, 2002, ACM, 1-58113-458-4. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
refal, functional programming languages, automatic program transformation |
36 | Christian Lengauer, Sergei Gorlatch, Christoph A. Herrmann |
The Static Parallelization of Loops and Recursions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Supercomput. ![In: J. Supercomput. 11(4), pp. 333-353, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
polytope model, parallelization, skeletons, divide-and-conquer, homomorphism, SPMD, higher-order function, loop nest |
36 | Anatoly Petrovich Beltiukov |
Automatical Synthesis of Programs with Recursions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Formal Methods in Programming and Their Applications ![In: Formal Methods in Programming and Their Applications, International Conference, Akademgorodok, Novosibirsk, Russia, June 28 - July 2, 1993, Proceedings, pp. 414-422, 1993, Springer, 3-540-57316-X. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
28 | Olivier Perriquet, Pedro Barahona |
Constraint-Based Strategy for Pairwise RNA Secondary Structure Prediction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EPIA ![In: Progress in Artificial Intelligence, 14th Portuguese Conference on Artificial Intelligence, EPIA 2009, Aveiro, Portugal, October 12-15, 2009. Proceedings, pp. 86-97, 2009, Springer, 978-3-642-04685-8. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
28 | Marco H. Terra, João Yoshiyuki Ishihara, Antonio C. Padoan Jr. |
Information Filtering and Array Algorithms for Descriptor Systems Subject to Parameter Uncertainties. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Signal Process. ![In: IEEE Trans. Signal Process. 55(1), pp. 1-9, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
28 | Jinjiang Yuan, Weiping Shang, Qi Feng |
A note on the scheduling with two families of jobs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Sched. ![In: J. Sched. 8(6), pp. 537-542, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
28 | Sridhar Gollamudi, Yih-Fang Huang |
Adaptive minimax filtering via recursive optimal quadratic approximations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCAS (3) ![In: Proceedings of the 1999 International Symposium on Circuits and Systems, ISCAS 1999, Orlando, Florida, USA, May 30 - June 2, 1999, pp. 142-145, 1999, IEEE, 0-7803-5471-0. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
28 | Huimin Lin |
Complete Proof Systems for Observation Congruences in Finite-Control pi-Calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 25th International Colloquium, ICALP'98, Aalborg, Denmark, July 13-17, 1998, Proceedings, pp. 443-454, 1998, Springer, 3-540-64781-3. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
28 | Paul S. Lewis |
Systolic architectures for adaptive multichannel least squares lattice filters. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. VLSI Signal Process. ![In: J. VLSI Signal Process. 2(1), pp. 29-36, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
26 | Soleda Leung |
Integrating visualization to make programming concepts concrete: dot net style. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGITE Conference ![In: Proceedings of the 7th Conference on Information Technology Education, SIGITE 2006, Minneapolis, Minnesota, USA, October 19-21, 2006, pp. 149-156, 2006, ACM, 1-59593-521-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
graphics, recursions, program visualization |
26 | Andrew Vogt |
Should Activation Functions be Affinely Recursive?. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCNN (1) ![In: Proceedings of the IEEE-INNS-ENNS International Joint Conference on Neural Networks, IJCNN 2000, Neural Computing: New Challenges and Perspectives for the New Millennium, Como, Italy, July 24-27, 2000, Volume 1, pp. 289-292, 2000, IEEE Computer Society, 0-7695-0619-4. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
affine recursions, scaling functions |
26 | Wenyu Lu, Dik Lun Lee, Jiawei Han 0001 |
A Study on the Structure of Linear Recursion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 6(5), pp. 723-737, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
linear recursion, variable connections, static bindings, chain connections, chain recursions, rule compilation, query information, optimized query-processing plans, rule classification, query processing, query processing, optimisation, database theory, deductive databases, deductive database, expansions, logic database |
22 | Antoine P. Leeman, Johannes Köhler, Florian Messerer, Amon Lahr, Moritz Diehl, Melanie N. Zeilinger |
Fast System Level Synthesis: Robust Model Predictive Control using Riccati Recursions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2401.13762, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
22 | Thomas W. Cusick, Younhwan Cheon |
The weight recursions for the 2-rotation symmetric quartic Boolean functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Adv. Math. Commun. ![In: Adv. Math. Commun. 17(3), pp. 589-604, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
22 | Rawwad Alhejaili, Motaz Alfarraj, Hamzah Luqman, Ali Al-Shaikhi |
Recursions Are All You Need: Towards Efficient Deep Unfolding Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2305.05505, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
22 | Congzao Dong, Alexander Marynych, Ilya Molchanov |
Set-valued recursions arising from vantage-point trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2312.05651, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
22 | Rawwad Alhejaili, Motaz Alfarraj, Hamzah Luqman, Ali Al-Shaikhi |
Recursions Are All You Need: Towards Efficient Deep Unfolding Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CVPR Workshops ![In: IEEE/CVF Conference on Computer Vision and Pattern Recognition, CVPR 2023 - Workshops, Vancouver, BC, Canada, June 17-24, 2023, pp. 4705-4714, 2023, IEEE, 979-8-3503-0249-3. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
22 | Ryota Numata, Tsuyoshi Kiyama |
Reduction in Computational Complexity of Recursions in SVD-based Recursive 4SID with Fixed Input-output Data Size. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SICE ![In: 62nd Annual Conference of the Society of Instrument and Control Engineers, SICE 2023, Tsu, Japan, September 6-9, 2023, pp. 724-729, 2023, IEEE, 978-4-9077-6480-7. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
22 | Kirshanthan Sundararajah, Charitha Saumya, Milind Kulkarni 0001 |
UniRec: a unimodular-like framework for nested recursions and loops. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proc. ACM Program. Lang. ![In: Proc. ACM Program. Lang. 6(OOPSLA2), pp. 1264-1290, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
22 | Paul Levrie, John Campbell |
Series acceleration formulas obtained from experimentally discovered hypergeometric recursions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. Theor. Comput. Sci. ![In: Discret. Math. Theor. Comput. Sci. 24(2), 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
22 | Abhishek Halder, Kenneth F. Caluya, Pegah Ojaghi, Xinbo Geng |
Stochastic Uncertainty Propagation in Power System Dynamics using Measure-valued Proximal Recursions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2108.13405, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
22 | Jáchym Barvínek, Timothy van Bremen, Yuyi Wang 0001, Filip Zelezný, Ondrej Kuzelka |
Automatic Conjecturing of P-Recursions Using Lifted Inference. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ILP ![In: Inductive Logic Programming - 30th International Conference, ILP 2021, Virtual Event, October 25-27, 2021, Proceedings, pp. 17-25, 2021, Springer, 978-3-030-97453-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
22 | Ali Zaghian, Bagher Bagherpour |
A Fast Publicly Verifiable Secret Sharing Scheme using Non-homogeneous Linear Recursions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISC Int. J. Inf. Secur. ![In: ISC Int. J. Inf. Secur. 12(2), pp. 91-99, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
22 | Eugene Gorsky, Mikhail Mazin, Monica Vazirani |
Recursions for rational q, t-Catalan numbers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. A ![In: J. Comb. Theory, Ser. A 173, pp. 105237, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
22 | Eric Adjakossa, Yannig Goude, Olivier Wintenberger |
Kalman Recursions Aggregated Online. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2002.12173, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
22 | Oguzhan Teke, P. P. Vaidyanathan |
Random Node-Asynchronous Graph Computations: Novel Opportunities for Discrete-Time State-Space Recursions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Signal Process. Mag. ![In: IEEE Signal Process. Mag. 37(6), pp. 64-73, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
22 | Tobias Johnson, Moumanti Podder, Fiona Skerman |
Random tree recursions: Which fixed points correspond to tangible sets of trees? ![Search on Bibsonomy](Pics/bibsonomy.png) |
Random Struct. Algorithms ![In: Random Struct. Algorithms 56(3), pp. 796-837, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
22 | Salwa Kobeissi, Alain Ketterlin, Philippe Clauss |
Rec2Poly: Converting Recursions to Polyhedral Optimized Loops Using an Inspector-Executor Strategy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAMOS ![In: Embedded Computer Systems: Architectures, Modeling, and Simulation - 20th International Conference, SAMOS 2020, Samos, Greece, July 5-9, 2020, Proceedings, pp. 96-109, 2020, Springer, 978-3-030-60938-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
22 | Rafah El-Khatib, Nicolas Macris, Tom Richardson 0001, Rüdiger L. Urbanke |
Displacement Convexity in Spatially Coupled Scalar Recursions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 65(1), pp. 604-621, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
22 | Elvin Isufi, Fernando Gama, Alejandro Ribeiro |
Generalizing Graph Convolutional Neural Networks with Edge-Variant Recursions on Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1903.01298, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
22 | Elvin Isufi, Andreas Loukas, Nathanaël Perraudin, Geert Leus |
Forecasting Time Series With VARMA Recursions on Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Signal Process. ![In: IEEE Trans. Signal Process. 67(18), pp. 4870-4885, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
22 | Oguzhan Teke, P. P. Vaidyanathan |
Randomized Asynchronous Recursions with a Sinusoidal Input. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACSSC ![In: 53rd Asilomar Conference on Signals, Systems, and Computers, ACSCC 2019, Pacific Grove, CA, USA, November 3-6, 2019, pp. 1491-1495, 2019, IEEE, 978-1-7281-4301-9. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
22 | Sang-Yoon Bae, James R. Morrison |
Exit Time Recursions, Recording Principles, and Queue Equivalence in Generalized Regular Flow Lines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CASE ![In: 15th IEEE International Conference on Automation Science and Engineering, CASE 2019, Vancouver, BC, Canada, August 22-26, 2019, pp. 922-929, 2019, IEEE, 978-1-7281-0356-3. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
22 | Bruno Mériaux, Chengfang Ren, Arnaud Breloy, Mohammed Nabil El Korso, Philippe Forster, Jean Philippe Ovarlez |
On the Recursions of Robust COMET Algorithm for Convexly Structured Shape Matrix. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUSIPCO ![In: 27th European Signal Processing Conference, EUSIPCO 2019, A Coruña, Spain, September 2-6, 2019, pp. 1-5, 2019, IEEE, 978-9-0827-9703-9. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
22 | Elvin Isufi, Fernando Gama, Alejandro Ribeiro |
Generalizing Graph Convolutional Neural Networks with Edge-Variant Recursions on Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUSIPCO ![In: 27th European Signal Processing Conference, EUSIPCO 2019, A Coruña, Spain, September 2-6, 2019, pp. 1-5, 2019, IEEE, 978-9-0827-9703-9. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
22 | Raghu Pasupathy, Peter W. Glynn, Soumyadip Ghosh, Fatemeh Sadat Hashemi |
On Sampling Rates in Simulation-Based Recursions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Optim. ![In: SIAM J. Optim. 28(1), pp. 45-73, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
22 | Thomas W. Cusick |
Weight Recursions for Any Rotation Symmetric Boolean Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 64(4), pp. 2962-2968, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
22 | Elvin Isufi, Andreas Loukas, Nathanaël Perraudin, Geert Leus |
Forecasting Time Series with VARMA Recursions on Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1810.08581, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
22 | Francis N. Castro, Robin Chapman, Luis A. Medina, L. Brehsner Sepúlveda |
Recursions associated to trapezoid, symmetric and rotation symmetric functions over Galois fields. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 341(7), pp. 1915-1931, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
22 | Michel Denault, Jean-Guy Simonato |
Dynamic portfolio choices by simulation-and-regression: Revisiting the issue of value function vs portfolio weight recursions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Oper. Res. ![In: Comput. Oper. Res. 79, pp. 174-189, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
22 | Rafah El-Khatib, Nicolas Macris, Tom Richardson 0001, Rüdiger L. Urbanke |
Displacement Convexity in Spatially Coupled Scalar Recursions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1701.04651, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
22 | Thomas W. Cusick |
Weight recursions for any rotation symmetric Boolean functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1701.06648, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
22 | Predrag Brodanac |
Recursions and how to teach them. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MIPRO ![In: 40th International Convention on Information and Communication Technology, Electronics and Microelectronics, MIPRO 2017, Opatija, Croatia, May 22-26, 2017, pp. 740-745, 2017, IEEE, 978-953-233-090-8. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
22 | Abraham Isgur, Robert Lech, Scott Moore, Stephen M. Tanny, Yvon Verberne, Yifan Zhang |
Constructing New Families of Nested Recursions with Slow Solutions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 30(2), pp. 1128-1147, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
22 | Ayaz ul Hassan Khan, Mayez Al-Mouhamed, Allam Fatayer, Nazeeruddin Mohammad |
Optimizing the Matrix Multiplication Using Strassen and Winograd Algorithms with Limited Recursions on Many-Core. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Parallel Program. ![In: Int. J. Parallel Program. 44(4), pp. 801-830, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
22 | Ayaz ul Hassan Khan, Mayez Al-Mouhamed, Allam Fatayer, Nazeeruddin Mohammad |
Erratum to: Optimizing the Matrix Multiplication Using Strassen and Winograd Algorithms with Limited Recursions on Many-Core. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Parallel Program. ![In: Int. J. Parallel Program. 44(4), pp. 831, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
22 | Lulu Wang 0001, Bixin Li, Hareton Leung |
A new method to encode calling contexts with recursions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Sci. China Inf. Sci. ![In: Sci. China Inf. Sci. 59(5), pp. 052104:1-052104:15, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
22 | Matthew C. Russell |
Noncommutative recursions and the Laurent phenomenon. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Adv. Appl. Math. ![In: Adv. Appl. Math. 64, pp. 21-30, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
22 | Pavel A. Akimov, Alexander I. Matasov |
Weight and Time Recursions in Dynamic State Estimation Problem With Mixed-Norm Cost Function. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Autom. Control. ![In: IEEE Trans. Autom. Control. 60(4), pp. 1050-1063, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
22 | László Mérai |
Pseudorandomness of binary sequences derived from linear recursions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Period. Math. Hung. ![In: Period. Math. Hung. 71(1), pp. 64-77, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
22 | Ningyuan Chen, Mariana Olvera-Cravioto |
Efficient simulation for branching linear recursions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WSC ![In: Proceedings of the 2015 Winter Simulation Conference, Huntington Beach, CA, USA, December 6-9, 2015, pp. 2716-2727, 2015, IEEE/ACM, 978-1-4673-9741-4. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
22 | Piotr Derugo |
Single node recursions in Adaptive Neuro-Fuzzy Controller. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CYBCONF ![In: 2nd IEEE International Conference on Cybernetics, CYBCONF 2015, Gdynia, Poland, June 24-26, 2015, pp. 433-438, 2015, IEEE, 978-1-4799-8322-3. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
22 | Abraham Isgur, Vitaly Kuznetsov, Mustazee Rahman, Stephen M. Tanny |
Nested Recursions, Simultaneous Parameters and Tree Superpositions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. J. Comb. ![In: Electron. J. Comb. 21(1), pp. 1, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
22 | Cécile Hardouin, Xavier Guyon |
Recursions on the marginals and exact computation of the normalizing constant for Gibbs processes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Stat. ![In: Comput. Stat. 29(6), pp. 1637-1650, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
22 | Arvind Yedla, Yung-Yih Jian, Phong S. Nguyen, Henry D. Pfister |
A Simple Proof of Maxwell Saturation for Coupled Scalar Recursions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 60(11), pp. 6943-6965, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
22 | Tobias Lutz |
Recursions for the trapdoor channel and an upper bound on its capacity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISIT ![In: 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29 - July 4, 2014, pp. 2914-2918, 2014, IEEE, 978-1-4799-5186-4. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
22 | Fatemeh Sadat Hashemi, Soumyadip Ghosh, Raghu Pasupathy |
On adaptive sampling rules for stochastic recursions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WSC ![In: Proceedings of the 2014 Winter Simulation Conference, Savannah, GA, USA, December 7-10, 2014, pp. 3959-3970, 2014, IEEE/ACM. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
22 | Balázs Kósa |
Structural Recursions on Edge-Labelled Graphs ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2014 |
RDF |
|
22 | Arvind Yedla, Yung-Yih Jian, Phong S. Nguyen, Henry D. Pfister |
A Simple Proof of Maxwell Saturation for Coupled Scalar Recursions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1309.7910, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
22 | Abraham Isgur, Vitaly Kuznetsov, Mustazee Rahman, Stephen M. Tanny |
Nested Recursions, Simultaneous Parameters and Tree Superpositions ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1301.5055, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
22 | Ricardo Merched |
A Unified Approach to Structured Covariances: Fast Generalized Sliding Window RLS Recursions for Arbitrary Basis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Signal Process. ![In: IEEE Trans. Signal Process. 61(23), pp. 6060-6075, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
22 | Laszlo Hars, Gyorgy Petruska |
Pseudorandom recursions II. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EURASIP J. Embed. Syst. ![In: EURASIP J. Embed. Syst. 2012, pp. 1, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
22 | Arvind Yedla, Yung-Yih Jian, Phong S. Nguyen, Henry D. Pfister |
A Simple Proof of Threshold Saturation for Coupled Vector Recursions ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1208.4080, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP BibTeX RDF |
|
22 | Arvind Yedla, Yung-Yih Jian, Phong S. Nguyen, Henry D. Pfister |
A Simple Proof of Threshold Saturation for Coupled Scalar Recursions ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1204.5703, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP BibTeX RDF |
|
22 | Arvind Yedla, Yung-Yih Jian, Phong S. Nguyen, Henry D. Pfister |
A simple proof of threshold saturation for coupled vector recursions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITW ![In: 2012 IEEE Information Theory Workshop, Lausanne, Switzerland, September 3-7, 2012, pp. 25-29, 2012, IEEE, 978-1-4673-0224-1. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
22 | Arvind Yedla, Yung-Yih Jian, Phong S. Nguyen, Henry D. Pfister |
A simple proof of threshold saturation for coupled scalar recursions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISTC ![In: 7th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2012, August 27-31, 2012, Gothenburg, Sweden, pp. 51-55, 2012, IEEE. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
22 | Abraham Isgur, Mustazee Rahman |
On Variants of Conway and Conolly's Meta-Fibonacci Recursions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. J. Comb. ![In: Electron. J. Comb. 18(1), 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
22 | Nicholas A. Loehr, Elizabeth M. Niese |
Recursions and divisibility properties for combinatorial Macdonald polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. Theor. Comput. Sci. ![In: Discret. Math. Theor. Comput. Sci. 13(1), pp. 21-44, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
22 | Arash Ghasemmehdi, Erik Agrell |
Faster Recursions in Sphere Decoding. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 57(6), pp. 3530-3536, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
22 | Diana Hay, Reza Rastegar, Alexander Roitershtein |
Multivariate linear recursions with Markov-dependent coefficients. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Multivar. Anal. ![In: J. Multivar. Anal. 102(3), pp. 521-527, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
22 | Ricardo Merched |
Fast generalized sliding window RLS recursions for IIR recurrence related basis functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DSP ![In: 17th International Conference on Digital Signal Processing, DSP 2011, Corfu, Greece, July 6-8, 2011, pp. 1-6, 2011, IEEE, 978-1-4577-0273-0. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
22 | Balázs Kósa, András A. Benczúr, Attila Kiss 0001 |
Satisfiability and Containment Problem of Structural Recursions with Conditions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ADBIS ![In: Advances in Databases and Information Systems - 14th East European Conference, ADBIS 2010, Novi Sad, Serbia, September 20-24, 2010. Proceedings, pp. 336-350, 2010, Springer, 978-3-642-15575-8. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
22 | R. Daniel Mauldin, Alexander P. McLinden |
Random closed sets viewed as random recursions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 48(3-4), pp. 257-263, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
22 | Massoud Hadian Dehkordi, Samaneh Mashhadi |
Verifiable secret sharing schemes based on non-homogeneous linear recursions and elliptic curves. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Commun. ![In: Comput. Commun. 31(9), pp. 1777-1784, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
22 | Alfredo Deaño, Javier Segura 0001, Nico M. Temme |
Identifying minimal and dominant solutions for Kummer recursions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Comput. ![In: Math. Comput. 77(264), pp. 2277-2293, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
22 | Laszlo Hars, Gyorgy Petruska |
Pseudorandom Recursions: Small and Fast Pseudorandom Number Generators for Embedded Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EURASIP J. Embed. Syst. ![In: EURASIP J. Embed. Syst. 2007, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
22 | Norman Danner, James S. Royer |
Time-complexity semantics for feasible affine recursions (extended abstract) ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/cs/0701076, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|