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