|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 12402 occurrences of 4451 keywords
|
|
|
Results
Found 28003 publication records. Showing 28003 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
21 | Jin-San Cheng, Xiao-Shan Gao, Jia Li 0023 |
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 |
21 | 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 |
21 | Zhonggang Zeng |
The approximate irreducible factorization of a univariate polynomial: revisited. |
ISSAC |
2009 |
DBLP DOI BibTeX RDF |
multiplicity, polynomial factoring, ill-posed problems |
21 | Bennett Thompson, David J. Pearce 0001, Craig Anslow, Gary Haggard |
Visualizing the computation tree of the Tutte Polynomial. |
SOFTVIS |
2008 |
DBLP DOI BibTeX RDF |
software visualization, Tutte Polynomial |
21 | Gang Xu 0001, 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 |
21 | 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 |
21 | 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 |
21 | 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 |
21 | 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 |
21 | 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 |
21 | Juan Manuel Peña 0001, Tomas Sauer |
Efficient polynomial reduction. |
Adv. Comput. Math. |
2007 |
DBLP DOI BibTeX RDF |
H-bases, polynomial reduction, numerical stability |
21 | Cristina Tîrnauca, Timo Knuutila |
Polynomial Time Algorithms for Learning k -Reversible Languages and Pattern Languages with Correction Queries. |
ALT |
2007 |
DBLP DOI BibTeX RDF |
k-reversible languages, pattern languages, polynomial algorithms, Correction queries |
21 | Yinghua Chen, Bican Xia, Lu Yang, Naijun Zhan |
Generating Polynomial Invariants with DISCOVERER and QEPCAD. |
Formal Methods and Hybrid Real-Time Systems |
2007 |
DBLP DOI BibTeX RDF |
Semi-Algebraic Systems, DISCOVERER, QEPCAD, Program Verification, Quantifier Elimination, Invariant Generation, Polynomial Programs |
21 | Nicolas Brisebarre, Sylvain Chevillard |
Efficient polynomial L-approximations. |
IEEE Symposium on Computer Arithmetic |
2007 |
DBLP DOI BibTeX RDF |
Efficient polynomial approximation, absolute error, L norm, floating-point arithmetic, LLL algorithm, lattice basis reduction, closest vector problem |
21 | Gui-Lin Zhang, Xiao-Shan Gao |
Properties of Ascending Chains for Partial Difference Polynomial Systems. |
ASCM |
2007 |
DBLP DOI BibTeX RDF |
Ascending chain, coherent chain, regular chain, irreducible chain, partial difference polynomial, characteristic set |
21 | Leslie Ann Goldberg, Mark Jerrum |
Inapproximability of the Tutte polynomial. |
STOC |
2007 |
DBLP DOI BibTeX RDF |
complexity, approximation, Tutte polynomial |
21 | Hiroshi Sekigawa |
The nearest polynomial with a zero in a given domain. |
SNC |
2007 |
DBLP DOI BibTeX RDF |
polynomial, perturbation, zero |
21 | Murray R. Bremner, Michael J. Hancock, Yunfeng Piao |
Nonassociative structures on polynomial algebras arising from bio-operations on formal languages: an application of computer algebra to nonassociative systems. |
ISSAC |
2007 |
DBLP DOI BibTeX RDF |
bio-operations, nonassociative algebra, polynomial identities, finite fields, formal languages, DNA computing, computer algebra, linear systems |
21 | Pramook Khungurn, Hiroshi Sekigawa, Kiyoshi Shirayanagi |
Minimum converging precision of the QR-factorization algorithm for real polynomial GCD. |
ISSAC |
2007 |
DBLP DOI BibTeX RDF |
algebraic algorithm stabilization, polynomial greatest common divisor |
21 | Arash Reyhani-Masoleh, M. Anwar Hasan |
Fault Detection Architectures for Field Multiplication Using Polynomial Bases. |
IEEE Trans. Computers |
2006 |
DBLP DOI BibTeX RDF |
polynomial basis multiplier, Finite fields, error detection |
21 | Len Bos, Marco Caliari, Stefano De Marchi, Marco Vianello |
A Numerical Study of the Xu Polynomial Interpolation Formula in Two Variables. |
Computing |
2006 |
DBLP DOI BibTeX RDF |
Bivariate polynomial interpolation, Xu points, Lagrange interpolation formula, Lebesgue constant |
21 | Eugene L. Allgower, Derrick J. Bates, Andrew J. Sommese, Charles W. Wampler |
Solution of Polynomial Systems Derived from Differential Equations. |
Computing |
2006 |
DBLP DOI BibTeX RDF |
Differential equations, polynomial systems, boundary value problems, numerical algebraic geometry, homotopy continuation |
21 | Vadim V. Lozin, Martin Milanic |
A polynomial algorithm to find an independent set of maximum weight in a fork-free graph. |
SODA |
2006 |
DBLP DOI BibTeX RDF |
polynomial-time algorithm, independent set |
21 | Shanshan Gao, Caiming Zhang 0001, Li Zhong |
Interpolation by Piecewise Quadric Polynomial to Scattered Data Points. |
ISVC (2) |
2006 |
DBLP DOI BibTeX RDF |
Scattered data points, Polynomial Surface, Interpolation, Energy, Triangle |
21 | Michael V. Basin, Joel Perez 0001 |
Optimal Filtering for Linear System States over Polynomial Observations. |
ICICIC (1) |
2006 |
DBLP DOI BibTeX RDF |
linear system state, nonlinear polynomial observations, stochastic system, Optimal filtering |
21 | Yu Liang, Ramdev Kanapady, Kumar K. Tamma |
An Efficient Parallel Finite-Element-Based Domain Decomposition Iterative Technique With Polynomial Preconditioning. |
ICPP Workshops |
2006 |
DBLP DOI BibTeX RDF |
distributed format, polynomial preconditioner, finite element, domain decomposition, linear equations, GMRES |
21 | Abir Jaafar Hussain, Adam Knowles, Paulo J. G. Lisboa, Wael El-Deredy, Dhiya Al-Jumeily |
Polynomial Pipelined Neural Network and Its Application to Financial Time Series Prediction. |
Australian Conference on Artificial Intelligence |
2006 |
DBLP DOI BibTeX RDF |
Polynomial neural network, pipelined network, exchange rate time series and financial time series prediction |
21 | Guillaume Moroz |
Complexity of the resolution of parametric systems of polynomial equations and inequations. |
ISSAC |
2006 |
DBLP DOI BibTeX RDF |
discriminant variety, parametric polynomial system, complexity, elimination |
21 | Henk Bekker, E. P. Braad, Boris Goldengorin |
Selecting the Roots of a Small System of Polynomial Equations by Tolerance Based Matching. |
WEA |
2005 |
DBLP DOI BibTeX RDF |
tolerance based bipartite matching, solving polynomial equations, combinatorial optimization |
21 | Henk Bekker, E. P. Braad, Boris Goldengorin |
Using Bipartite and Multidimensional Matching to Select the Roots of a System of Polynomial Equations. |
ICCSA (4) |
2005 |
DBLP DOI BibTeX RDF |
system of polynomial equations, combinatorial optimization, bipartite matching |
21 | Barry H. Dayton, Zhonggang Zeng |
Computing the multiplicity structure in solving polynomial systems. |
ISSAC |
2005 |
DBLP DOI BibTeX RDF |
multiplicity, polynomial ideal, dual space |
21 | Bernard Mourrain |
Generalized normal forms and polynomial system solving. |
ISSAC |
2005 |
DBLP DOI BibTeX RDF |
quotient algebra, normal form, multivariate polynomial, symbolic-numeric computation, root-finding |
21 | Thomas C. M. Lee, Hee-Seok Oh |
Automatic polynomial wavelet regression. |
Stat. Comput. |
2004 |
DBLP DOI BibTeX RDF |
boundary adjustment, polynomial wavelet regression, Stein's unbiased risk estimation, wavelet thresholding, Bayesian Information Criterion, empirical Bayes |
21 | Kazushige Terui |
Light Affine Set Theory: A Naive Set Theory of Polynomial Time. |
Stud Logica |
2004 |
DBLP DOI BibTeX RDF |
naive set theory, light logic, linear logic, polynomial time, substructural logics |
21 | Manuel Kauers |
Computer proofs for polynomial identities in arbitrary many variables. |
ISSAC |
2004 |
DBLP DOI BibTeX RDF |
computer proofs, polynomial identities |
21 | Alin Bostan, Bruno Salvy, Éric Schost |
Fast Algorithms for Zero-Dimensional Polynomial Systems using Duality. |
Appl. Algebra Eng. Commun. Comput. |
2003 |
DBLP DOI BibTeX RDF |
Linear recurrent sequences, Duality, Polynomial system solving |
21 | Claire Whelan, Adam Duffy, Andrew Burnett, Tom Dowling |
A Java API for polynomial arithmetic. |
PPPJ |
2003 |
DBLP BibTeX RDF |
Java, Java, polynomial, API, arithmetic |
21 | Arash Reyhani-Masoleh, M. Anwarul Hasan |
Error Detection in Polynomial Basis Multipliers over Binary Extension Fields. |
CHES |
2002 |
DBLP DOI BibTeX RDF |
polynomial basis multiplier, fault tolerant computing, Finite fields, error detection |
21 | Daniel Kobler, Udi Rotics |
Polynomial algorithms for partitioning problems on graphs with fixed clique-width (extended abstract). |
SODA |
2001 |
DBLP BibTeX RDF |
coloring, dominating set, polynomial algorithms, edge-coloring, clique-width, edge-dominating set |
21 | Y. Liang, Jim Weston, Marek Szularz |
Polynomial Preconditioning for Specially Structured Linear Systems of Equations. |
Euro-Par |
2001 |
DBLP DOI BibTeX RDF |
polynomial preconditioner, FGMRES, specially structured, solution of linear systems, generalised least-squares |
21 | Volker Barthelmann, Erich Novak, Klaus Ritter 0001 |
High dimensional polynomial interpolation on sparse grids. |
Adv. Comput. Math. |
2000 |
DBLP DOI BibTeX RDF |
multivariate polynomial interpolation, least solution, 65D05, 41A63, tractability, 41A05, 41A25, sparse grids, universal method |
21 | Klaus Aehlig, Helmut Schwichtenberg |
A Syntactical Analysis of Non-Size-Increasing Polynomial Time Computation. |
LICS |
2000 |
DBLP DOI BibTeX RDF |
affine linear typing, polynomial time computation, lambda-calculus |
21 | Hartmut Prautzsch, Ulrich Reif |
Degree estimates for Ck-piecewise polynomial subdivision surfaces. |
Adv. Comput. Math. |
1999 |
DBLP DOI BibTeX RDF |
piecewise polynomial surface, extraordinary point, subdivision, arbitrary topology |
21 | Markus Bläser |
Bivariate Polynomial Multiplication. |
FOCS |
1998 |
DBLP DOI BibTeX RDF |
multiplicative complexity, polynomial multiplication, bilinear complexity |
21 | Supratik Chakraborty, David L. Dill |
More Accurate Polynomial-Time Min-Max Timing Simulation. |
ASYNC |
1997 |
DBLP DOI BibTeX RDF |
Uncertain component delays, min-max timing simulation, thirteen-valued signal algebra, polynomial-time algorithm |
21 | Edith Cohen |
Learning Noisy Perceptrons by a Perceptron in Polynomial Time. |
FOCS |
1997 |
DBLP DOI BibTeX RDF |
noisy perceptron learning, linear threshold functions, labeled examples, random classification noise, PAC learnable, linear thresholds, single threshold function, machine learning, polynomial time, learning by example, hypothesis |
21 | Tadayoshi Horita, Itsuo Takanami |
A Polynomial Time Algorithm for Reconfiguring the 1 1/2 Track-Switch Model with PE and Bus faults. |
ISPAN |
1997 |
DBLP DOI BibTeX RDF |
mesh arrays, the 1frac{1}{2} track-switch model, fault-tolerance, polynomial time algorithm, wafer scale integration |
21 | Zhuxing Zhao, Zhongcheng Li, Yinghua Min |
Waveform Polynomial Manipulation Using Bdds. |
Asian Test Symposium |
1996 |
DBLP DOI BibTeX RDF |
waveform polynomial manipulation, design verification and test, middle size circuits, complexity, data structure, high level synthesis, timing, logic design, combinational circuit, logic synthesis, binary decision diagram, directed acyclic graph, digital circuit, Boolean process |
21 | Zhibin Lei, David B. Cooper |
New, faster, more controlled fitting of implicit polynomial 2D curves and 3D surfaces to data . |
CVPR |
1996 |
DBLP DOI BibTeX RDF |
implicit polynomial 2D curves fitting, 3D surfaces, global geometric constraints, object recognition, linear programming, linear programming, curve fitting, distance measures |
21 | Merlin Hughes, Christopher DiMattia, Ming C. Lin, Dinesh Manocha |
Efficient And Accurate Interference Detection For Polynomial Deformation. |
CA |
1996 |
DBLP DOI BibTeX RDF |
polynomial deformation, soft object animation, Bezier patches, axis aligned bounding boxes, surface intersection tests, loop intersection tests, animation, computational geometry, linear programming, linear programming, geometric models, computer animation, deformable models, solid modelling, solid models, B-splines, convex hulls, subdivision, parametric surfaces, dynamic simulation, splines (mathematics), polygonal meshes, variational models, interference detection, frame-to-frame coherence |
21 | Maurice Mignotte |
On the distance between the roots of a polynomial. |
Appl. Algebra Eng. Commun. Comput. |
1995 |
DBLP DOI BibTeX RDF |
Roots of a polynomial, Separating the roots, Complex polynomials, Integer polynomials |
21 | John Case, Timo Kötzing |
Difficulties in Forcing Fairness of Polynomial Time Inductive Inference. |
ALT |
2009 |
DBLP DOI BibTeX RDF |
|
21 | Ilya Averbouch, Johann A. Makowsky, Peter Tittmann 0001 |
A Graph Polynomial Arising from Community Structure (Extended Abstract). |
WG |
2009 |
DBLP DOI BibTeX RDF |
|
21 | Stefan Kratsch, Magnus Wahlström |
Two Edge Modification Problems without Polynomial Kernels. |
IWPEC |
2009 |
DBLP DOI BibTeX RDF |
|
21 | Ning Dong 0002, Jaijeet S. Roychowdhury |
General-Purpose Nonlinear Model-Order Reduction Using Piecewise-Polynomial Representations. |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. |
2008 |
DBLP DOI BibTeX RDF |
|
21 | Artur Jutman, Anton Tsertov, Raimund Ubar |
Calculation of LFSR Seed and Polynomial Pair for BIST Applications. |
DDECS |
2008 |
DBLP DOI BibTeX RDF |
|
21 | Eduardo Mojica-Nava, Nicanor Quijano, Alain Gauthier, Naly Rakoto-Ravalontsalama |
Stability analysis of switched polynomial systems using dissipation inequalities. |
CDC |
2008 |
DBLP DOI BibTeX RDF |
|
21 | Shinobu Nagayama, Tsutomu Sasao, Jon T. Butler |
Design Method for Numerical Function Generators Based on Polynomial Approximation for FPGA Implementation. |
DSD |
2007 |
DBLP DOI BibTeX RDF |
|
21 | Zeev Dvir, Ariel Gabizon, Avi Wigderson |
Extractors and Rank Extractors for Polynomial Sources. |
FOCS |
2007 |
DBLP DOI BibTeX RDF |
|
21 | Harry Buhrman, Lance Fortnow, Michal Koucký 0001, John D. Rogers, Nikolai K. Vereshchagin |
Inverting Onto Functions and Polynomial Hierarchy. |
CSR |
2007 |
DBLP DOI BibTeX RDF |
|
21 | Seok-Beom Roh, Tae-Chon Ahn |
Fuzzy Combined Polynomial Neural Networks. |
KES (3) |
2007 |
DBLP DOI BibTeX RDF |
|
21 | Takuya Kitamoto, Tetsu Yamaguchi |
On the Computation of the Defining Polynomial of the Algebraic Riccati Equation. |
CASC |
2007 |
DBLP DOI BibTeX RDF |
|
21 | Tae-Chon Ahn, Kyung-Won Jang, Seok-Beom Roh |
Genetically Optimized Fuzzy Set-Based Polynomial Neural Networks Based on Information Granules with Aids of Symbolic Genetic Algorithms. |
KES (3) |
2006 |
DBLP DOI BibTeX RDF |
|
21 | Daniel Stronger, Peter Stone |
Polynomial Regression with Automated Degree: A Function Approximator for Autonomous Agents. |
ICTAI |
2006 |
DBLP DOI BibTeX RDF |
|
21 | Bruno Codenotti, Sriram V. Pemmaraju, Kasturi R. Varadarajan |
On the polynomial time computation of equilibria for certain exchange economies. |
SODA |
2005 |
DBLP BibTeX RDF |
|
21 | Martin Zinkevich, Avrim Blum, Tuomas Sandholm |
On polynomial-time preference elicitation with value queries. |
EC |
2003 |
DBLP DOI BibTeX RDF |
learning, combinatorial auctions, preference elicitation |
21 | Thanh Minh Hoang, Thomas Thierauf |
On the Minimal Polynomial of a Matrix. |
COCOON |
2002 |
DBLP DOI BibTeX RDF |
|
21 | Leslie G. Valiant |
Quantum computers that can be simulated classically in polynomial time. |
STOC |
2001 |
DBLP DOI BibTeX RDF |
|
21 | Vadim Olshevsky, Victor Y. Pan |
Polynomial and Rational Evaluation and Interpolation (with Structured Matrices). |
ICALP |
1999 |
DBLP DOI BibTeX RDF |
|
21 | Chua-Chin Wang, Cheng-Fa Tsai |
Theoretical expectation value of the capacity of fuzzy polynomial bidirectional hetero-correlator. |
ISCAS (5) |
1999 |
DBLP DOI BibTeX RDF |
|
21 | Miki Hermann, Phokion G. Kolaitis |
Unification Algorithms Cannot be Combined in Polynomial Time. |
CADE |
1996 |
DBLP DOI BibTeX RDF |
|
21 | Nai-Wei Lin |
Approximating the Chromatic Polynomial of a Graph. |
WG |
1993 |
DBLP DOI BibTeX RDF |
|
21 | Jun Tarui |
Randomized Polynomials, Threshold Circuits, and the Polynomial Hierarchy. |
STACS |
1991 |
DBLP DOI BibTeX RDF |
|
20 | 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 |
20 | Mei-E Fang, Guozhao Wang |
omegaB-splines. |
Sci. China Ser. F Inf. Sci. |
2008 |
DBLP DOI BibTeX RDF |
?B-splines, trigonometric polynomial B-splines, hyperbolic polynomial B-splines, B-splines, frequencies |
20 | Morteza Moniri |
Preservation theorems for bounded formulas. |
Arch. Math. Log. |
2007 |
DBLP DOI BibTeX RDF |
Polynomial induction, Model completeness, Universal theory, Quantifier elimination, Intuitionistic logic, NP, Bounded arithmetic, Polynomial hierarchy, Kripke model |
20 | Steven B. Damelin |
Pointwise bounds of orthogonal expansions on the real line via weighted Hilbert transforms. |
Adv. Comput. Math. |
2007 |
DBLP DOI BibTeX RDF |
Freud weight, Hilbert transform, pointwise convergence, orthonormal expansions, weighted polynomial approximation, Fourier series, polynomial approximation |
20 | Stef Graillat, Philippe Langlois |
Pseudozero set of interval polynomials. |
SAC |
2006 |
DBLP DOI BibTeX RDF |
interval polynomial, pseudozero set, uncertainty, interval arithmetic, perturbation, polynomial root |
20 | Paul M. Terwilliger |
Two Linear Transformations each Tridiagonal with Respect to an Eigenbasis of the other; Comments on the Parameter Array. |
Des. Codes Cryptogr. |
2005 |
DBLP DOI BibTeX RDF |
Leonard pair, tridiagonal pair, Askey-Wilson polynomial, q-Racah polynomial |
20 | Ilyas Eker |
The design of robust multi-loop-cascaded hydro governors. |
Eng. Comput. |
2004 |
DBLP DOI BibTeX RDF |
Nomenclature, Polynomial notation is employed and the polynomials are assumed to be functions of the complex s variable, X* denotes complex conjugate of the X., a. S: complex frequency and is the frequency., b. R+: Set of all positive real numbers, c. R: Set of all real numbers, d. R(.): Set of all real rational functions, e. R[.]: Set of finite polynomials with real coefficients, f. Rmxm(.): Set of all real (mxm) matrices, g. Rmxm[.]: Set of polynomial (mxm) matrices |
20 | Luca Gemignani |
A generalized Graeffe's iteration for evaluating polynomials and rational functions. |
ISSAC |
2001 |
DBLP DOI BibTeX RDF |
Graeffe's iteration, fast approximate polynomial evaluation, meromorphic functions, residue computation, polynomial zeros |
20 | Bernd Sturmfels, Markus Wiegelmann |
Structural Gröbner Basis Detection. |
Appl. Algebra Eng. Commun. Comput. |
1997 |
DBLP DOI BibTeX RDF |
Gröbner basis, Variation of term orders, System of polynomial equations, NP-completeness, Polynomial time algorithm |
20 | Toshikazu Wada, Hiroyuki Ukida, Takashi Matsuyama |
Shape from Shading with Interreflections under Proximal Light Source: 3D Shape Reconstruction of Unfolded Book Surface from a Scanner Image. |
ICCV |
1995 |
DBLP DOI BibTeX RDF |
piecewise polynomial techniques, unfolded book surface, scanner image, proximal light source, real world environments, moving light source, nonuniform albedo distribution, iterative nonlinear optimization scheme, piecewise polynomial models, image restoration experiments, photometric distortions, optimisation, iterative methods, image restoration, shading, specular reflection, geometric distortions, light sources, light reflection, interreflections, albedo, 3D shape reconstruction |
20 | Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara |
Reconstruction of Interval Graphs. |
COCOON |
2009 |
DBLP DOI BibTeX RDF |
the graph reconstruction conjecture, polynomial time algorithm, interval graphs |
20 | Mario Vélez, Juan Ospina, Doracelly Hincapié |
Tutte Polynomials and Topological Quantum Algorithms in Social Network Analysis for Epidemiology, Bio-surveillance and Bio-security. |
BioSecure |
2008 |
DBLP DOI BibTeX RDF |
Aharonov-Arab-E bal-Landau algorithm, Topological Quantum Computation, Basic Reproductive Number, Social Network Analysis, Borders, Tutte Polynomial |
20 | Margreta Kuijper, Raquel Pinto |
Minimal Trellis Construction for Finite Support Convolutional Ring Codes. |
ICMCTA |
2008 |
DBLP DOI BibTeX RDF |
polynomial module, row reduced, p-generator sequence, minimal trellis, convolutional code, finite ring |
20 | Xi-Shun Zhao, Yu-Ping Shen |
Comparison of Semantics of Disjunctive Logic Programs Based on Model-Equivalent Reduction. |
J. Comput. Sci. Technol. |
2007 |
DBLP DOI BibTeX RDF |
polynomial-time model-equivalent reduction, semantics, quantified Boolean formula, disjunctive logic program |
20 | Haiyan Cheng, Adrian Sandu |
Numerical study of uncertainty quantification techniques for implicit stiff systems. |
ACM Southeast Regional Conference |
2007 |
DBLP DOI BibTeX RDF |
least-square collocation, uncertainty quantification, polynomial chaos |
20 | Hiroshi Sekigawa |
On real factors of real interval polynomials. |
ISSAC |
2007 |
DBLP DOI BibTeX RDF |
interval polynomial, factor, divisibility, polytope |
20 | Christopher W. Brown 0001, Scott McCallum |
On using bi-equational constraints in CAD construction. |
ISSAC |
2005 |
DBLP DOI BibTeX RDF |
CAD, polynomial systems |
20 | Dorit S. Hochbaum |
An efficient algorithm for image segmentation, Markov random fields and related problems. |
J. ACM |
2001 |
DBLP DOI BibTeX RDF |
parametric minimum cut, Markov random fields, Convex optimization, strongly polynomial algorithms |
20 | Rong Lin |
Trading Bitwidth For Array Size: A Unified Reconfigurable Arithmetic Processor Design. |
ISQED |
2001 |
DBLP DOI BibTeX RDF |
IP design, inner product processor, matrix multiplier, run-time reconfigurable architecture, SOC, array multiplier, polynomial evaluation |
20 | Dima Grigoriev, Yagati N. Lakshman |
Algorithms for Computing Sparse Shifts for Multivariate Polynomials. |
Appl. Algebra Eng. Commun. Comput. |
2000 |
DBLP DOI BibTeX RDF |
Shifted sparse polynomial, Gröbner bases, Complexity. > |
20 | Jay Belanger, Aduri Pavan, Jie Wang 0002 |
Reductions Do Not Preserve Fast Convergence Rates in Average Time. |
Algorithmica |
1999 |
DBLP DOI BibTeX RDF |
Average polynomial time, Distributional problem, Reductions |
20 | David A. McAllester, Robert Givan |
Taxonomic Syntax for First Order Inference. |
J. ACM |
1993 |
DBLP DOI BibTeX RDF |
machine inference, theorem proving, polynomial time algorithms, automated reasoning, inference rules, proof theory, proof systems, mechanical verification |
20 | Hans L. Bodlaender |
Dynamic Programming on Graphs with Bounded Treewidth. |
ICALP |
1988 |
DBLP DOI BibTeX RDF |
graph decision problems, restrictions of NP-complete problems, local condition compositions, dynamic programming, polynomial time algorithms, Treewidth, partial k-trees |
20 | Zeev Dvir, Amir Shpilka, Amir Yehudayoff |
Hardness-randomness tradeoffs for bounded depth arithmetic circuits. |
STOC |
2008 |
DBLP DOI BibTeX RDF |
bounded depth circuits, hardness-randomness tradeoffs, identity testing, lower bounds, arithmetic circuits |
20 | Leonid Gurvits |
Hyperbolic polynomials approach to Van der Waerden/Schrijver-Valiant like conjectures: sharper bounds, simpler proofs and algorithmic applications. |
STOC |
2006 |
DBLP DOI BibTeX RDF |
hyperbolic polynomials, graph, convex optimization, permanent |
20 | Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten |
Complexity of the Min-Max (Regret) Versions of Cut Problems. |
ISAAC |
2005 |
DBLP DOI BibTeX RDF |
min-max regret, s–t min cut, complexity, min cut, min-max |
20 | Lincong Wang, Ramgopal R. Mettu, Bruce Randall Donald |
An Algebraic Geometry Approach to Protein Structure Determination from NMR Data. |
CSB |
2005 |
DBLP DOI BibTeX RDF |
|
Displaying result #201 - #300 of 28003 (100 per page; Change: ) Pages: [ <<][ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ 11][ 12][ >>] |
|