搜索结果: 1-7 共查到“计算机科学技术 Polynomial”相关记录7条 . 查询时间(0.146 秒)
Some Trade-off Results for Polynomial Calculus
Proof complexity polynomial calculus PCR resolution trade-offs size space degree pebble games
2016/1/23
We present size-space trade-offs for the polynomial calculus(PC) and polynomial calculus resolution (PCR) proof sys-tems. These are the first true size-space trade-offs in any algebraic proof system, ...
Homomorphic Signatures for Polynomial Functions
Polynomial Functions Homomorphic Signatures
2015/8/5
We construct the first homomorphic signature scheme that is capable of evaluating multivariate polynomials on signed data. Given the public key and a signed data set, there is an efficient algorithm t...
Robust Optimal Control using Polynomial Chaos and Adjoints for Systems with Uncertain Inputs
Robust Optimal Control Polynomial Chaos Adjoints Systems Uncertain Inputs
2015/7/3
The objective of this note is to show how one can combine Polynomial Chaos Expansions(PCE) and adjoint theory to efficiently obtain sensitivities for robust optimal control. A non-intrusive PCE m...
Polynomial-Time Isomorphism Test for Groups with No Abelian Normal Subgroups
Group Isomorphism Permutational Isomorphism Code Equivalence
2012/10/10
We consider the problem of testing isomorphism of groups of order n given by Cayley tables. The trivial nlog n bound on the time complexity for the general case has not been improved upon over the pas...
Mahalanobis Distance Based Polynomial Segment Model For Chinese Sign Language Recogniton
Mahalanobis Distance Polynomial Segment Model Chinese Sign Language Recogniton
2008/12/31
Sign Language Recognition (SLR) systems are mostly based on Hidden Markov Model (HMM) and have achieved excellent results. However, the assumption of frame independence in HMM makes it inconsistent wi...
MAHALANOBIS DISTANCE BASED POLYNOMIAL SEGMENT MODEL FOR CHINESE SIGN LANGUAGE RECOGNITON
Sign Language Recognition Hidden Markov Model Polynomial Segment Model Mahalanobis distance
2008/6/17
Sign Language Recognition (SLR) systems are mostly based on Hidden Markov Model (HMM) and have achieved excellent results. However, the assumption of frame independence in HMM makes it inconsistent wi...
A fast algorithm for determing the minimal polynomial of a sequence with period 2pn over GF(q)
2007/7/28
奖励信息
奖励名称
A fast algorithm for determing the minimal polynomial of a sequence with period 2pn over GF(q)
完成人
魏仕民,肖国镇,陈钟
完成单位
推荐单位
授奖机构
安徽省
授奖日期
2003年
月
日
奖励种类
第四届自然科学优秀论文
奖励等级
奖励编号
相关项目
序列密码新算法研究