2127 search results - page 292 / 426 » Computing large matchings fast |
142
Voted
ISCAS
2007
IEEE
15 years 10 months ago
2007
IEEE
— Hermitian Codes offer desirable properties such as large code lengths, good error-correction at high code rates, etc. The main problem in making Hermitian codes practical is to...
113
Voted
FCCM
2004
IEEE
15 years 7 months ago
2004
IEEE
Searching for multiple string patterns in a stream of data is a computationally expensive task. The speed of the search pattern module determines the overall performance of deep p...
157
click to vote
C3S2E
2010
ACM
15 years 5 months ago
2010
ACM
Propositional satisfiability solving, or SAT, is an important reasoning task arising in numerous applications, such as circuit design, formal verification, planning, scheduling or...
133
click to vote
VC
2008
15 years 4 months ago
2008
Abstract We propose a method for non-uniform reconstruction of 3D scalar data. Typically, radial basis functions, trigonometric polynomials or shift-invariant functions are used in...
140
click to vote
MOC
2011
14 years 7 months ago
2011
Abstract. We present three algorithms to calculate Φn(z), the nth cyclotomic polynomial. The first algorithm calculates Φn(z) by a series of polynomial divisions, which we perfo...