Sciweavers

50808 search results - page 220 / 10162
» A New
Sort
View
ISSAC
2007
Springer
112views Mathematics» more  ISSAC 2007»
14 years 3 months ago
G-graphs for the cage problem: a new upper bound
Constructing some regular graph with a given girth, a given degree and the fewest possible vertices is a hard problem. This problem is called the cage graph problem and has some l...
Alain Bretto, Luc Gillibert
MCS
2007
Springer
14 years 3 months ago
A New HMM-Based Ensemble Generation Method for Numeral Recognition
A new scheme for the optimization of codebook sizes for HMMs and the generation of HMM ensembles is proposed in this paper. In a discrete HMM, the vector quantization procedure and...
Albert Hung-Ren Ko, Robert Sabourin, Alceu de Souz...
NETCOOP
2007
Springer
14 years 3 months ago
A New Necessary Condition for Shortest Path Routing
In shortest path routing, traffic is routed along shortest paths defined by link weights. However, not all path systems are feasible in that they can be realized in this way. This...
Mats Petter Pettersson, Krzysztof Kuchcinski
PKC
2007
Springer
147views Cryptology» more  PKC 2007»
14 years 3 months ago
New Chosen-Ciphertext Attacks on NTRU
We present new and efficient key-recovery chosen-ciphertext attacks on NTRUencrypt. Our attacks are somewhat intermediate between chosen-ciphertext attacks on NTRUencrypt previousl...
Nicolas Gama, Phong Q. Nguyen
SAT
2007
Springer
121views Hardware» more  SAT 2007»
14 years 3 months ago
MiniMaxSat: A New Weighted Max-SAT Solver
In this paper we introduce MINIMAXSAT, a new Max-SAT solver that incorporates the best SAT and Max-SAT techniques. It can handle hard clauses (clauses of mandatory satisfaction as ...
Federico Heras, Javier Larrosa, Albert Oliveras
« Prev « First page 220 / 10162 Last » Next »