The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for polynomial with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1959-1960 (15) 1961-1963 (18) 1964-1967 (27) 1968-1969 (17) 1970-1972 (18) 1973-1974 (31) 1975 (20) 1976 (37) 1977 (22) 1978 (22) 1979 (26) 1980 (38) 1981 (35) 1982 (31) 1983 (38) 1984 (69) 1985 (85) 1986 (82) 1987 (97) 1988 (145) 1989 (187) 1990 (218) 1991 (183) 1992 (251) 1993 (247) 1994 (281) 1995 (302) 1996 (303) 1997 (349) 1998 (399) 1999 (467) 2000 (527) 2001 (648) 2002 (739) 2003 (805) 2004 (1171) 2005 (1297) 2006 (1459) 2007 (1537) 2008 (1639) 2009 (1309) 2010 (604) 2011 (513) 2012 (183)
Publication types (Num. hits)
article(6255) book(3) incollection(45) inproceedings(10183) phdthesis(5)
Venues (Conferences, Journals, ...)
FOCS(377) CoRR(323) STOC(319) ICALP(316) ISSAC(310) SODA(279) ISAAC(235) J. ACM(234) STACS(232) MFCS(220) WG(166) ISCAS(160) IEEE Trans. on CAD of Integrat...(156) Theor. Comput. Sci.(155) IEEE Transactions on Signal Pr...(153) IEEE Trans. Computers(152) More (+10 of total 1614)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 12405 occurrences of 4454 keywords

Results
Found 16491 publication records. Showing 16491 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
5Mark Giesbrecht, Daniel S. Roche On lacunary polynomial perfect powers. Search on Bibsonomy ISSAC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF black box polynomial, lacunary polynomial, perfect power, sparse polynomial
5Michel Cosnard, Pierre Fraigniaud Analysis of Asynchronous Polynomial Root Finding Methods on a Distributed Memory Multicomputer. Search on Bibsonomy IEEE Trans. Parallel Distrib. Syst. The full citation details ... 1994 DBLP  DOI  BibTeX  RDF poles and zeros, distributed memorysystems, asynchronous polynomial root finding, iterative polynomial root finding, locally convergent, asynchronous methods, synchronous, convergence, polynomials, convergence of numerical methods, distributed memory multicomputer, hypercube multicomputer, polynomial zeros
5László Babai, Lajos Rónyai Computing Irreducible Representations of Finite Groups Search on Bibsonomy FOCS The full citation details ... 1989 DBLP  DOI  BibTeX  RDF deterministic polynomial time, matrices list, randomized polynomial time, Las Vegas polynomial time, generators set, bit complexity, inequivalent irreducible representations, multiplication table, polynomial-size description, absolutely irreducible constituents, polynomial-time algorithm, equivalence class, finite groups, complex numbers, exact computations, algebraic number fields
4Peter Bürgisser, Felipe Cucker Solving polynomial equations in smoothed polynomial time and a near solution to smale's 17th problem. Search on Bibsonomy STOC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF approximate zero, polynomial equation solving, complexity, polynomial time, smoothed analysis, homotopy methods
4Xumin Liu, Weixiang Xu, Yong Guan, Yuanyuan Shang Trigonometric polynomial uniform B-spline surface with shape parameter. Search on Bibsonomy Int. Conf. Interaction Sciences The full citation details ... 2009 DBLP  DOI  BibTeX  RDF trigonometric polynomial uniform B-spline with shape parameters, uniform trigonometric polynomial B-spline, C++, computer graphics, surface modeling, computer aided geometric design
4Jianping Li, Weidong Li, Jianbo Li Polynomial Approximation Schemes for the Max-Min Allocation Problem under a Grade of Service Provision. Search on Bibsonomy COCOA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Scheduling, allocation, polynomial time approximation scheme, fully polynomial time approximation scheme, grade of service
4Vikraman Arvind, Partha Mukhopadhyay, Srikanth Srinivasan New Results on Noncommutative and Commutative Polynomial Identity Testing. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2008 DBLP  DOI  BibTeX  RDF randomized, polynomial time, deterministic, polynomial identity testing
4Hiroshi Sekigawa, Kiyoshi Shirayanagi On the Location of Pseudozeros of a Complex Interval Polynomial. Search on Bibsonomy Mathematics in Computer Science The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Interval polynomial, polynomial, convex set, zero
4Jaewook Chung, M. Anwar Hasan Montgomery Reduction Algorithm for Modular Multiplication Using Low-Weight Polynomial Form Integers. Search on Bibsonomy IEEE Symposium on Computer Arithmetic The full citation details ... 2007 DBLP  DOI  BibTeX  RDF More generalized Mersenne numbers, Low-weight polynomial form integers, adapted modular number system, polynomial modular number system, Montgomery reduction algorithm
4Haining Fan, M. Anwar Hasan Relationship between GF(2m) Montgomery and Shifted Polynomial Basis Multiplication Algorithms. Search on Bibsonomy IEEE Trans. Computers The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Montgomery multiplication algorithm, shifted polynomial basis, Finite field, multiplication, polynomial basis, irreducible trinomial
4Erich Kaltofen, Zhengfeng Yang, Lihong Zhi Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials. Search on Bibsonomy ISSAC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF approximate multiple root, approximate polynomial gcd, multivariate polynomial gcd, singular polynomial, linear constraint, symbolic/numeric hybrid method
4Omer Giménez, Petr Hlinený, Marc Noy Computing the Tutte Polynomial on Graphs of Bounded Clique-Width. Search on Bibsonomy WG The full citation details ... 2005 DBLP  DOI  BibTeX  RDF subexponential algorithm, U polynomial, cographs, clique-width, Tutte polynomial
4Jean-Guillaume Dumas, Clément Pernet, Zhendong Wan Efficient computation of the characteristic polynomial. Search on Bibsonomy ISSAC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Keller-Gehrig, Magma, finite field, probabilistic algorithm, characteristic polynomial, integer, minimal polynomial
4Arne Storjohann, Gilles Villard Computing the rank and a small nullspace basis of a polynomial matrix. Search on Bibsonomy ISSAC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF matrix rank, minimal polynomial basis, nullspace basis, polynomial matrix, linear algebra
4Joachim von zur Gathen, Igor Shparlinski Polynomial interpolation from multiples. Search on Bibsonomy SODA The full citation details ... 2004 DBLP  DOI  BibTeX  RDF black box polynomial, hidden polynomial, integer lattices, short vectors, approximate computation
4Josep M. Brunat, Antonio Montes The characteristic ideal of a finite, connected, regular graph. Search on Bibsonomy ISSAC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF characteristic ideal, galois graph, polynomial digraph, polynomial graph, strongly polynomial graph, variety of a pairing, pairing, connected component, conjecture
4Sung-Kwun Oh, James F. Peters, Witold Pedrycz, Tae-Chon Ahn Genetically Optimized Rule-Based Fuzzy Polynomial Neural Networks: Synthesis of Computational Intelligence Technologies. Search on Bibsonomy RSFDGrC The full citation details ... 2003 DBLP  DOI  BibTeX  RDF Rule-base fuzzy polynomial neural networks(RFPNN), rule-based fuzzy neural networks(RFNN), polynomial neural networks(PNN), computational intelligence(CI), genetic algorithms(GAs), design methodology
4Arash Reyhani-Masoleh, M. Anwarul Hasan On Low Complexity Bit Parallel Polynomial Basis Multipliers. Search on Bibsonomy CHES The full citation details ... 2003 DBLP  DOI  BibTeX  RDF Finite or Galois field, Mastrovito multiplier, pentanomial, trinomial and equally-spaced polynomial, polynomial basis
4Erich Kaltofen Polynomial factorization: a success story. Search on Bibsonomy ISSAC The full citation details ... 2003 DBLP  DOI  BibTeX  RDF black box polynomial, randomized algorithm, polynomial factorization, lattice basis reduction, symbolic/numeric hybrid method, straight line program
4Pascal Giorgi, Claude-Pierre Jeannerod, Gilles Villard On the complexity of polynomial matrix computations. Search on Bibsonomy ISSAC The full citation details ... 2003 DBLP  DOI  BibTeX  RDF column reduced form, matrix gcd, matrix polynomial, minimal basis, polynomial matrix multiplication, determinant
4Yuan Xu Polynomial interpolation in several variables, cubature formulae, and ideals[*]Supported by the National Science Foundation under Grant DMS-9802265. Search on Bibsonomy Adv. Comput. Math. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF polynomial interpolation in several variables, 65D05, 41A63, orthogonal polynomials, variety, 41A05, 41A10, polynomial ideals, 13P10, cubature formulae
4Don Coppersmith Small Solutions to Polynomial Equations, and Low Exponent RSA Vulnerabilities. Search on Bibsonomy J. Cryptology The full citation details ... 1997 DBLP  DOI  BibTeX  RDF RSA, RSA, Polynomial, Polynomial, Factoring, Factoring, Key words
4Ching-Chih Han, Hung-Ying Tyan A better polynomial-time schedulability test for real-time fixed-priority scheduling algorithm. (PDF / PS) Search on Bibsonomy IEEE Real-Time Systems Symposium The full citation details ... 1997 DBLP  DOI  BibTeX  RDF polynomial-time schedulability test, real-time fixed-priority scheduling algorithms, closed-form utilization, polynomial-time schedulability, processor scheduling, schedulability condition
4Leonid Khachiyan, Lorant Porkolab Computing Integral Points in Convex Semi-algebraic Sets. Search on Bibsonomy FOCS The full citation details ... 1997 DBLP  DOI  BibTeX  RDF convex semi-algebraic sets, polynomial inequalities, linear integer programming, semidefinite integer programming, integer programming, polynomial-time algorithm, polynomial-time solvability
4T. E. Hull, R. Mathon The Mathematical Basis and a Prototype Implementation of a New Polynomial Rootfinder With Quadratic Convergence. Search on Bibsonomy ACM Trans. Math. Softw. The full citation details ... 1996 DBLP  DOI  BibTeX  RDF polynomial rootfinder, polynomial zerofinder, quadratic convergence
4Ker-I Ko, Klaus Weihrauch On the Measure of Two-Dimensional Regions with Polynomial-Time computables Boundaries. (PDF / PS) Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 1996 DBLP  DOI  BibTeX  RDF Lebesgue measure, two-dimensional region, polynomial-time computable boundary, interior region, polynomial-time computable, computational complexity, computability, computability, Turing machines
4Lisa Hellerstein, Krishnan Pillaipakkamnatt, Vijay V. Raghavan, Dawn Wilkins How Many Queries Are Needed to Learn? Search on Bibsonomy J. ACM The full citation details ... 1996 DBLP  DOI  BibTeX  RDF exact identification, polynomial-query learning, polynomial-time learning, proper learning, certificates, membership queries, equivalence queries, polynomial-time hierarchy
4Zeljko Zilic, Zvonko G. Vranesic Reed-Muller Forms for Incompletely Specified Functions via Sparse Polynomial Interpolation. (PDF / PS) Search on Bibsonomy ISMVL The full citation details ... 1995 DBLP  DOI  BibTeX  RDF Reed-Muller forms, sparse polynomial interpolation, MVL RM transforms, interpolation, multivalued logic, Reed-Muller codes, polynomial interpolation, incompletely specified functions, computationally efficient algorithm
4Joseph M. Francos, Benjamin Friedlander The polynomial phase difference operator for modeling of nonhomogeneous images. (PDF / PS) Search on Bibsonomy ICIP The full citation details ... 1995 DBLP  DOI  BibTeX  RDF polynomial phase difference operator, nonhomogeneous images, 2D signals, constant modulus polynomial-phase model, parameter estimation algorithm, phase differencing operator, modelling, modeling, image processing, parameter estimation, polynomials
4Noga Alon, Alan M. Frieze, Dominic Welsh Polynomial time randomised approxmiation schemes for the Tutte polynomial of dense graphs Search on Bibsonomy FOCS The full citation details ... 1994 DBLP  DOI  BibTeX  RDF polynomial time randomised approximation schemes, dense graphs, Tutte-Grothendieck polynomial, combinatorial quantities, spanning forests, strongly connected orientations, k-colorings, reliability probability, P-hard, ferromagnetic Q-state Potts model, linear matroids, weight enumerator, linear codes, partition functions, Tutte polynomial
4Michel Cosnard, Pierre Fraigniaud A Performance Analysis of Network Topologies in Finding the Roots of a Polynomial. Search on Bibsonomy CONPAR The full citation details ... 1990 DBLP  DOI  BibTeX  RDF local memory parallel computers, simultaneous polynomial root-finders, Parallel algorithms, broadcasting, polynomial zeros
4S. Y. Ku, R. J. Adler Computing polynomial resultants: Bezout's determinant vs. Collins' reduced P.R.S. algorithm. Search on Bibsonomy Commun. ACM The full citation details ... 1969 DBLP  DOI  BibTeX  RDF Bezout's determinant, Sylvester's determinant, g.c.d algorithm, multivariate polynomial equations, polynomial resultant, reduced p.r.s algorithm, resultant algorithm, Euclidean algorithm, elimination
4Terence R. F. Nonweiler Algorithms: Algorithm 326: Roots of low-order polynomial equations. Search on Bibsonomy Commun. ACM The full citation details ... 1968 DBLP  DOI  BibTeX  RDF biquadratic equation roots, cubic equation roots, polynomial equation roots, quadratic equation roots, rootfinders, polynomial zeros
3Christoph Fünfzig, Dominique Michelucci, Sebti Foufou Polytope-based computation of polynomial ranges. Search on Bibsonomy SAC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF polynomial ranges, polytopes, multivariate polynomials, Bernstein polynomials
3Michael Barton, Gershon Elber, Iddo Hanniel Topologically guaranteed univariate solutions of underconstrained polynomial systems via no-loop and single-component tests. Search on Bibsonomy Symposium on Solid and Physical Modeling The full citation details ... 2010 DBLP  DOI  BibTeX  RDF kinematic synthesis, trisector curves, underconstrained polynomial systems, univariate solution spaces
3Ilias Diakonikolas, Prahladh Harsha, Adam Klivans, Raghu Meka, Prasad Raghavendra, Rocco A. Servedio, Li-Yang Tan Bounding the average sensitivity and noise sensitivity of polynomial threshold functions. Search on Bibsonomy STOC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF average sensitivity, boolean function, fourier analysis, noise sensitivity, polynomial threshold function
3Grzegorz W. Wasilkowski, Henryk Wozniakowski Polynomial-Time Algorithms for Multivariate Linear Problems with Finite-Order Weights: Average Case Setting. Search on Bibsonomy Foundations of Computational Mathematics The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Multivariate linear problems, Finite-order weights, Small effective dimension, Average case setting, Polynomial-time algorithms, Tractability
3Jun-Bao Li, Jeng-Shyang Pan, Zhe-Ming Lu Face recognition using Gabor-based complete Kernel Fisher Discriminant analysis with fractional power polynomial models. Search on Bibsonomy Neural Computing and Applications The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Complete Kernel Fisher Discriminant (CKFD), Fractional Power Polynomial (FPP) models, Face recognition, Gabor wavelet, Kernel-based method
3Guojun Li, Xiaotie Deng, Ying Xu A polynomial-time approximation scheme for embedding hypergraph in a cycle. Search on Bibsonomy ACM Transactions on Algorithms The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Hypergraph embedding, minimum congestion, NP-hard, polynomial-time approximation scheme
3Gennadiy Averkov, Martin Henk Three-Dimensional Polyhedra Can Be Described by Three Polynomial Inequalities. Search on Bibsonomy Discrete & Computational Geometry The full citation details ... 2009 DBLP  DOI  BibTeX  RDF ?ojasiewicz’s inequality, Theorem of Bröcker and Scheiderer, Polynomial, Polytope, Semi-algebraic set
3Eric J. Friedman Finding a Simple Polytope from Its Graph in Polynomial Time. Search on Bibsonomy Discrete & Computational Geometry The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Graph, Polynomial time, Polytope
3Martin Byröd, Klas Josephson, Kalle Åström Fast and Stable Polynomial Equation Solving and Its Application to Computer Vision. Search on Bibsonomy International Journal of Computer Vision The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Gröbner basis, Structure from motion, Polynomial equations, Minimal problems
3Martin Fürer Efficient Computation of the Characteristic Polynomial of a Tree and Related Tasks. Search on Bibsonomy ESA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF counting matchings, counting independent sets, bounded tree-width, efficient algorithms, characteristic polynomial
3Ana M. C. Ruedin Theorems Relating Polynomial Approximation, Orthogonality and Balancing Conditions for the Design of Nonseparable Bidimensional Multiwavelets. Search on Bibsonomy ACIVS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF nonseparable, polynomial reproduction, quincunx, balancing, multiwavelets
3Ondrej Klíma, Libor Polák Polynomial Operators on Classes of Regular Languages. Search on Bibsonomy CAI The full citation details ... 2009 DBLP  DOI  BibTeX  RDF positive varieties of languages, polynomial operators
3Cristina Borralleras, Salvador Lucas, Rafael Navarro-Marset, Enric Rodríguez-Carbonell, Albert Rubio Solving Non-linear Polynomial Arithmetic via SAT Modulo Linear Arithmetic. Search on Bibsonomy CADE The full citation details ... 2009 DBLP  DOI  BibTeX  RDF polynomial constraints, SAT modulo theories, program analysis, termination, Constraint solving
3Anna Rubi-Velez, Eduardo Gómez-Ramírez, Giovanni Egidio Pazienza Computing the Weights of Polynomial Cellular Neural Networks Using Quadratic Programming. Search on Bibsonomy CIARP The full citation details ... 2009 DBLP  DOI  BibTeX  RDF polynomial cellular neural networks, cellular automata, quadratic programming
3Suraj Sindia, Virendra Singh, Vishwani D. Agrawal Polynomial coefficient based DC testing of non-linear analog circuits. Search on Bibsonomy ACM Great Lakes Symposium on VLSI The full citation details ... 2009 DBLP  DOI  BibTeX  RDF DC test, non-linear circuit test, polynomial, curve fitting, parametric faults
3Kyriaki Ioannidou, George B. Mertzios, Stavros D. Nikolopoulos The Longest Path Problem Is Polynomial on Interval Graphs. Search on Bibsonomy MFCS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Longest path problem, complexity, dynamic programming, interval graphs, polynomial algorithm
3Shiyan Hu, Zhuo Li, Charles J. Alpert A fully polynomial time approximation scheme for timing driven minimum cost buffer insertion. Search on Bibsonomy DAC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF dynamic programming, NP-complete, buffer insertion, fully polynomial time approximation scheme, cost minimization
3O. Sarbishei, Bijan Alizadeh, Masahiro Fujita Polynomial datapath optimization using partitioning and compensation heuristics. Search on Bibsonomy DAC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF modular HED, polynomial datapath, high-level synthesis
3Pradip Sircar, Ram Bilas Pachori, Rupendra Kumar Analysis of rhythms of EEG signals using orthogonal polynomial approximation. Search on Bibsonomy ICHIT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF EEG signal rhythms, orthogonal polynomial approximation, wavelet packet decomposition, multi-resolution analysis
3Maris Tõnso, Ülle Kotta Realization of Continuous-Time Nonlinear Input-Output Equations: Polynomial Approach. Search on Bibsonomy EUROCAST The full citation details ... 2009 DBLP  DOI  BibTeX  RDF input-output models, polynomial methods, state space realization, nonlinear control system, continuous-time system
3Radomir S. Stankovic, Jaakko Astola, Claudio Moraga Convolution on Finite Groups and Fixed-Polarity Polynomial Expressions. Search on Bibsonomy EUROCAST The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Polynomial expressions, Spectral representations, Convolution, Finite groups
3Alexey S. Rodionov, Olga K. Rodionova, Hyunseung Choo Using Meaning of Coefficients of the Reliability Polynomial for Their Faster Calculation. Search on Bibsonomy ICCSA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF reliability polynomial, factoring method
3Gérald Gavin, Marine Minier Oblivious Multi-variate Polynomial Evaluation. Search on Bibsonomy INDOCRYPT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Homomorphic encryption schemes, Oblivious Polynomial Evaluation (OPE), semantic security
3Robert Ganian, Petr Hlinený Better Polynomial Algorithms on Graphs of Bounded Rank-Width. Search on Bibsonomy IWOCA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Rank-width, rank-decomposition, chromatic polynomial, Hamiltonian path, chromatic number
3Gábor Ivanyos, Marek Karpinski, Nitin Saxena Schemes for deterministic polynomial factoring. Search on Bibsonomy ISSAC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF grh, schemes, polynomial factoring, representation theory
3Daniel Andres, Viktor Levandovskyy, Jorge Martín-Morales Principal intersection and bernstein-sato polynomial of an affine variety. Search on Bibsonomy ISSAC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF bernstein-sato polynomial of variety, initial ideal, intersection with subalgebra, non-commutative gr?bner bases, preimage of ideal, annihilator, d-modules
3Jin-San Cheng, Xiao-Shan Gao, Jia Li Root isolation for bivariate polynomial systems with local generic position method. Search on Bibsonomy ISSAC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF bivariate polynomial system, generic position, root bound, root isolation
3Zhonggang Zeng The approximate irreducible factorization of a univariate polynomial: revisited. Search on Bibsonomy ISSAC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF multiplicity, polynomial factoring, ill-posed problems
3Martin Mevissen, Kosuke Yokoyama, Nobuki Takayama Solutions of polynomial systems derived from the steady cavity flow problem. Search on Bibsonomy ISSAC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF finite difference discretization, polynomial optimization, semidefinite programming relaxation, steady cavity flow problem, sparsity
3Jean-Guillaume Dumas, Clément Pernet, B. David Saunders On finding multiplicities of characteristic polynomial factors of black-box matrices. Search on Bibsonomy ISSAC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF finite field, characteristic polynomial, black-box matrix
3Xin Li, Marc Moreno Maza, Wei Pan Computations modulo regular chains. Search on Bibsonomy ISSAC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF fast polynomial arithmetic, regular chain, regular gcd, polynomial systems, triangular decomposition, subresultants
3Sameh M. Shohdy, Ashraf El-Sisi, Nabil A. Ismail FPGA Implementation of Elliptic Curve Point Multiplication over GF(2191). Search on Bibsonomy ISA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Karatsuba-Ofman multiplier, polynomial inversion, field programmable gate arrays, Elliptic curve cryptography, Galois field, polynomial multiplication
3Sébastien Labbé, Jean-Pierre Gallois Slicing communicating automata specifications: polynomial algorithms for model reduction. Search on Bibsonomy Formal Asp. Comput. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Communicating automata, Specifications, Static analysis, Slicing, Dataflow analysis, Model reduction, Polynomial algorithms
3Kai Strunz, Qianli Su Stochastic formulation of SPICE-type electronic circuit simulation with polynomial chaos. Search on Bibsonomy ACM Trans. Model. Comput. Simul. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Galerkin projection, electronic circuit, nonsampling stochastic analysis, tolerance analysis, SPICE, circuit simulation, spectral methods, transients, power electronics, stochastic differential equations, polynomial chaos, Circuit modeling
3Wan-Chun Ma, Andrew Jones, Jen-Yuan Chiang, Tim Hawkins, Sune Frederiksen, Pieter Peers, Marko Vukovic, Ming Ouhyoung, Paul E. Debevec Facial performance synthesis using deformation-driven polynomial displacement maps. Search on Bibsonomy ACM Trans. Graph. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF facial performance synthesis, polynomial displacement maps
3Dominique de Werra, Tamás Kis, Wieslaw Kubiak Preemptive open shop scheduling with multiprocessors: polynomial cases and applications. Search on Bibsonomy J. Scheduling The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Preemptive open shop scheduling, Multiprocessor operations, Polynomial time algorithms
3Rozaida Ghazali, Abir Jaafar Hussain, Panos Liatsis, H. Tawfik The application of ridge polynomial neural network to multi-step ahead financial time series prediction. Search on Bibsonomy Neural Computing and Applications The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Ridge polynomial neural networks, Functional link neural networks, Pi-Sigma neural networks, Multilayer perceptrons, Financial time series
3Changbo Chen, Marc Moreno Maza, Wei Pan, Yuzhen Xie On the verification of polynomial system solvers. Search on Bibsonomy Frontiers of Computer Science in China The full citation details ... 2008 DBLP  DOI  BibTeX  RDF polynomial system solver, software verification, triangular decomposition
3Benjamin Braun Norm Bounds for Ehrhart Polynomial Roots. Search on Bibsonomy Discrete & Computational Geometry The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Lattice polytopes, Ehrhart theory, Polynomial roots
3Jonathan Katz, Yehuda Lindell Handling Expected Polynomial-Time Strategies in Simulation-Based Security Proofs. Search on Bibsonomy J. Cryptology The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Expected polynomial-time, Black-box simulation, Zero-knowledge, Secure multiparty computation
3Hayato Waki, Sunyoung Kim, Masakazu Kojima, Masakazu Muramatsu, Hiroshi Sugimoto Algorithm 883: SparsePOP---A Sparse Semidefinite Programming Relaxation of Polynomial Optimization Problems. Search on Bibsonomy ACM Trans. Math. Softw. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Matlab software package, polynomial optimization problem, semidefinite programming relaxation, sums-of-squares optimization, Global optimization, sparsity
3Zhiguo Zhang, Shing-Chow Chan, Ka-Leung Ho, K. C. Ho On Bandwidth Selection in Local Polynomial Regression Analysis and Its Application to Multi-resolution Analysis of Non-uniform Data. Search on Bibsonomy Signal Processing Systems The full citation details ... 2008 DBLP  DOI  BibTeX  RDF adaptive bandwidth selection, intersection of confidence intervals, local polynomial regression, non-uniformly sampled data analysis, wavelet
3Chiou-Yng Lee, Che Wun Chiou New Bit-Parallel Systolic Architectures for Computing Multiplication, Multiplicative Inversion and Division in GF(2m) Under Polynomial Basis and Normal Basis Representations. Search on Bibsonomy Signal Processing Systems The full citation details ... 2008 DBLP  DOI  BibTeX  RDF finite field, normal basis, polynomial basis, bit-parallel systolic multiplier
3Tian-Li Yu, Wei-Kai Lin Optimal sampling of genetic algorithms on polynomial regression. Search on Bibsonomy GECCO The full citation details ... 2008 DBLP  DOI  BibTeX  RDF fitness relaxation, function mapping, optimal sampling, genetic algorithms, speedup technique, polynomial regression
3Juan J. Cerrolaza, Arantxa Villanueva, Rafael Cabeza Taxonomic study of polynomial regressions applied to the calibration of video-oculographic systems. Search on Bibsonomy ETRA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF taxonomic classification, video-oculographic, calibration, gaze tracking, polynomial equation, multiple linear regression
3Jin Feng Wang, Kwong-Sak Leung, Kin-Hong Lee, Zhenyuan Wang Polynomial Nonlinear Integrals. Search on Bibsonomy ISNN The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Nonlinear integrals, Polynomial nonlinear integrals, Classification, Projection
3Aleksandar Peckov, Saso Dzeroski, Ljupco Todorovski A Minimal Description Length Scheme for Polynomial Regression. Search on Bibsonomy PAKDD The full citation details ... 2008 DBLP  DOI  BibTeX  RDF minimal description length, regression, polynomial regression
3Bennett Thompson, David J. Pearce, Craig Anslow, Gary Haggard Visualizing the computation tree of the Tutte Polynomial. Search on Bibsonomy SOFTVIS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF software visualization, Tutte Polynomial
3Feng-Hao Liu, Chi-Jen Lu, Bo-Yin Yang Secure PRNGs from Specialized Polynomial Maps over Any . Search on Bibsonomy PQCrypto The full citation details ... 2008 DBLP  DOI  BibTeX  RDF sparse multivariate polynomial map, hash function, provable security, PRNG
3Valery Yakhno, Meltem Altunkaynak Symbolic Computation of an Exact Solution of the Cauchy Problem for the System of Crystal Optics with Polynomial Data. Search on Bibsonomy NAA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF system of crystal optics, symbolic computations, Analytical method, initial value problem, polynomial solutions
3Weikang Qian, Marc D. Riedel The synthesis of robust polynomial arithmetic with stochastic logic. Search on Bibsonomy DAC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF polynomial arithmetic, stochastic logic, probabilistic logic
3Gang Xu, Guozhao Wang Parametric Polynomial Minimal Surfaces of Degree Six with Isothermal Parameter. Search on Bibsonomy GMP The full citation details ... 2008 DBLP  DOI  BibTeX  RDF harmonic surfaces, isothermal parametric surface, parametric polynomial minimal surface of degree six, membrane structure, minimal surface
3Arash Hariri, Arash Reyhani-Masoleh Digit-Serial Structures for the Shifted Polynomial Basis Multiplication over Binary Extension Fields. Search on Bibsonomy WAIFI The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Shifted polynomial basis, binary extension fields, digit-serial, multiplication
3Arash Reyhani-Masoleh A New Bit-Serial Architecture for Field Multiplication Using Polynomial Bases. Search on Bibsonomy CHES The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Finite or Galois field, Mastrovito multiplier, polynomial basis, bit-serial multiplier
3Abdulah Abdulah Zadeh A Novel Approach for Multiplication over GF(2m) in Polynomial Basis Representation. Search on Bibsonomy ARES The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Hybrid multiplier, GF, Polynomial (Standard) Basis, Finite Field
3Jean-Charles Faugère, Guillaume Moroz, Fabrice Rouillier, Mohab Safey El Din Classification of the perspective-three-point problem, discriminant variety and real solving polynomial systems of inequalities. Search on Bibsonomy ISSAC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF perspective-three-point problem, computer vision, complexity, real solutions, polynomial system solving
3Hiroshi Sekigawa The nearest polynomial with a zero in a given domain from a geometrical viewpoint. Search on Bibsonomy ISSAC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF davenport-schinzel sequence, l?-norm, polynomial, perturbation, zero
3Mohab Safey El Din Computing the global optimum of a multivariate polynomial over the reals. Search on Bibsonomy ISSAC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF complexity, global optimization, real solutions, polynomial system solving
3Songxin Liang, David J. Jeffrey, Marc Moreno Maza The complete root classification of a parametric polynomial on an interval. Search on Bibsonomy ISSAC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF complete root classification, parametric polynomial, real quantifier elimination, interval, real root
3Zohar Shay Karnin, Amir Shpilka Black Box Polynomial Identity Testing of Generalized Depth-3 Arithmetic Circuits with Bounded Top Fan-In. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2008 DBLP  DOI  BibTeX  RDF PIT, depth-3, arithmetic circuit, deterministic, polynomial identity testing
3Christopher Umans Fast polynomial factorization and modular composition in small characteristic. Search on Bibsonomy STOC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF modular composition, multipoint evaluation, polynomial factorization
3Amir M. Ben-Amram, Neil D. Jones, Lars Kristiansen Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time. Search on Bibsonomy CiE The full citation details ... 2008 DBLP  DOI  BibTeX  RDF linear time complexity, static program analysis, polynomial time complexity, implicit computational complexity
3Pascale Charpin, Gohar M. M. Kyureghyan On a Class of Permutation Polynomials over F2m. Search on Bibsonomy SETA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF linearized polynomial, Boolean function, trace, linear structure, Permutation polynomial
3Mei'E Fang, GuoZhao Wang omegaB-splines. Search on Bibsonomy Science in China Series F: Information Sciences The full citation details ... 2008 DBLP  DOI  BibTeX  RDF ?B-splines, trigonometric polynomial B-splines, hyperbolic polynomial B-splines, B-splines, frequencies
3Hiroki Arimura, Takeaki Uno An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Maximal motif, Data mining, Algorithm, Delay, Polynomial time, Pattern discovery, Enumeration, Motif, Sequence mining, Closed pattern, Closed itemset
3Sivaram Gopalakrishnan, Priyank Kalla Optimization of polynomial datapaths using finite ring algebra. Search on Bibsonomy ACM Trans. Design Autom. Electr. Syst. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF arithmetic datapaths, finite ring algebra, modulo arithmetic, polynomial datapaths, High-level synthesis
3Dongwon Kim, Gwi-Tae Park Advanced self-organizing polynomial neural network. Search on Bibsonomy Neural Computing and Applications The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Advanced self-organizing polynomial neural networks, Small number of input variables, Limited data set, Neural networks, Identification, Fuzzy system, Nonlinear system
Displaying result #1 - #100 of 16491 (100 per page; Change: )
Pages: [1][2][3][4][5][6][7][8][9][10][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.