Search Results

You are looking at 1 - 10 of 187 items for :

  • Computer Sciences, other x
Clear All
Open access

Antal Járai and Gyöngyvér Kiss

References [1] M. Agrawal, N. Kayal, N. Saxena, PRIMES is in P, Annals Math. 160, 2 (2004) 781-793. →35 [2] A. O. L. Atkin, F. Morain, Elliptic curves and primality proving Math. Comp. 61, 203 (1993) 29-68. →36, 39, 41, 43 [3] D. Bernstein, Proving primality in essentially quartic random time, Math. Comp. 76, 257 (2007) 389-403. →35 [4] W. Bosma, J. Cannon, C. Playoust, The Magma algebra system. I. The user language, J. Symbolic Comput. 24, 3-4 (1997) 235-265. →41 [5] G. Farkas, G

Open access

Antal Iványi, Gergő Gombos, Loránd Lucz and Tamás Matuszka

¨uller-Hannemann, How to attack the NP-complete dag realization problems in practice. arXiv, arXiv:1203.36v1, 2012. http://arxiv.org/abs/1203.3636 ⇒250 [16] N. Bödei, Degree sequences of graphs (Hungarian), Mathematical master thesis (supervisor A. Frank), Dept. of Operation Research of Eötvös Loránd University, Budapest, 2010, 43 pages. ⇒246 [17] B. Bollobás, The distribution of the maximum degree of a random graph, DiscreteMath. 32, 2 (1980) 201-203. ⇒250 [18] B. Bollobás, A probabilistic proof of an asymptotic formula for the number

Open access

K. R. Udaya Kumar Reddy

(1976) 49–60. ⇒22 [42] Z. Galil, O. Margalit, All pairs shortest distances for graphs with small integer length edges, Inform. Comput. 134, 2 (1997) 103–139. ⇒23, 24, 25 [43] T. Hagerup, Improved shortest paths on the word RAM, Proc. International Colloquium on Automata, Languages, and Programming (ICALP) , Lecture Notes in Computer Science 1853 (2000) 61–72. ⇒24, 27 [44] K. Han, C. N. Sekharan, R. Sridhar, Unified all-pairs shortest path algorithms in the chordal hierarchy, Discrete Appl. Math. 77, 1 (1997) 59–71. ⇒20, 26 [45] Y

Open access

Suda Kumaraswamy, Dammavalam Srinivasa Rao and Nuthanapati Naveen Kumar

References [1] P. Balasubramaniam, V. P. Ananthi: Image fusion using intuitionistic fuzzy sets, Elsever Journal of Information Fusion 20 (2014) 21-30. ⇒245 [2] B. Biswas, K. N. Dey, A. Chakrabarti, Remote sensing image fusion using multithreshold Otsu method in Shearlet domain, Procedia Computer Science 57, (2015) 554-562. ⇒242 [3] Y. Chen, Z. Qin, PCNN-based image fusion in compressed domain, Mathematical Problems in Engineering, Vol. 2015. ⇒242 [4] A. Ellmauthaler, C. L. Pagliari, E. A. B. da

Open access

Ágnes Fülöp

References [1] C. Adami, N.T. Cerf, Physical complexity of symbolic sequences, Physica D 137 (2000) 62–69. ⇒242 [2] A. Aiello, A. Barone, G. A. Ovsyannikov, Influence of nonlinear conductance and cos ϕ term on the onset of chaos in Josephson junctions, Phys. Rev. B 30 (1984) 456. ⇒249 [3] C. Anteneodo, A.R. Plastino, Some features of the Lpez-Ruiz-Manchini-Calbet (LMC) statistical measure of complexity, Physics Letters A 223 (1996) 348–354. ⇒243 [4] M. Basseville, Information: Entropies, Divergences et Mayennes, (IRISA

Open access

Muhammad Rizwan Rashid Rana, Asif Nawaz and Javed Iqbal

Physical Journal (2016) 76 : 107. ⇒ 67 [4] R. N. Behera, R. Manan, S. Dash, Ensemble based hybrid machine learning approach for sentiment classification – A Review, International Journal of Computer Applications 146 , 6 (2016) 31–36. ⇒ 59 [5] S. Brody, N. Diakopoulos, Cooooooooooooooollllllllllllll!!!!!!!!!!!!!!: using word lengthening to detect sentiment in microblogs, Conference on Empirical Methods in Natural Language Processing , 2007, pp. 562–570. ⇒ 64 [6] Y. Choi, H.Lee, Data properties and the performance of sentiment classification for

Open access

Ágnes Fülöp

References [1] C. Adami, N. T. Cerf, Physical complexity of symbolic sequences, Physica D 137, 1-2 (2000) 62-69. ⇒230 [2] C. Anteneodo, A. R. Plastino, Some features of the L´opez-Ruiz-Manchini-Calbet (LMC) statistical measure of complexity, Physics Letters A 223, 5 (1996) 348-354, ⇒231 [3] V. Botella-Soler, J. M. Castelo, J. A. Oteo, J. Ros, Bifurcations in the Lozi map, Journ. Phys. A: Math. Theor. 44, 30 (2011) 305101-305115. ⇒241 [4] X. Calbet, R. Lopez-Ruiz, Extremism complexity distribution

Open access

Attila Bódis

] H. Shachnai, T. Tamir, Polynomial time approximation schemes for class-constrained packing problems, Journal of Scheduling , 4, 6 (2001) 313–338. ⇒33 [23] H. Shachnai, T. Tamir, On two class-constrained versions of the multiple knapsack problem, Algorithmica , 29, 3 (2001) 442–467. ⇒33 [24] K. Thulasiraman, M. N. S. Swamy, 5.7 Acyclic Directed Graphs , Graphs: Theory and Algorithms , John Wiley and Sons, 1992. 118. ⇒43 [25] J. D. Ullman, The performance of a memory allocation algorithm., Princeton University, Department of Electrical

Open access

Bilal A. Chat, Shariefudddin Pirzada and Antal Iványi

, (2) (1985) 123-127. ⇒256 [5] Z. Blázsik, M. Hujter, A. Pluhár, Zs. Tuza, Graphs with no induced C4 and 2K2, Discrete Math., 115 (1993) 51-55. ⇒256, 263 [6] E. Boros, V. A. Gurvich, I. Zverovich, On split and almost CIS-graphs, Australas. J. Combin., 43 (2009) 163-180. ⇒255 [7] A. Brandst¨adt, Partitions of graphs into one or two stable sets and cliques, Discrete Math., 152 (1996) 47-54. ⇒254, 256 [8] A. Brandst¨adt, Corrigendum, Discrete Math., 186 (1998) 295-295. ⇒254, 256 [9] A

Open access

On partial sorting in restricted rounds

Dedicated to the memory of Antal Iványi

Antal Iványi and Norbert Fogarasi

References [1] M. Aigner, Selecting the top three elements, Discrete Appl. Math., 4 (1982) 242– 262. )18 [2] M. Aigner, The double selection problem, Discrete Math., 73 (1989) 3–12. )18 [3] M. Aigner, Finding the maximum and minimum, Discrete Appl. Math., 97 (1997) 1–12. )18 [4] M. Ajtai, J. Komlos, E. Szemeredi, Sorting in O(log n) steps, Combinatorica, 3, 1 (1983) 1–19. )19 [5] N. Alon, Y. Azar, U. Vishkin, Tight complexity bounds for parallel comparison sorting, IEEE Symp