Sciweavers

7978 search results - page 671 / 1596
» Combining shared-coin algorithms
Sort
View
TOG
2002
119views more  TOG 2002»
15 years 6 months ago
Interactive geometry remeshing
We present a novel technique, both flexible and efficient, for interactive remeshing of irregular geometry. First, the original (arbitrary genus) mesh is substituted by a series o...
Pierre Alliez, Mark Meyer, Mathieu Desbrun
JAIR
2010
145views more  JAIR 2010»
15 years 5 months ago
Fast Set Bounds Propagation Using a BDD-SAT Hybrid
Binary Decision Diagram (BDD) based set bounds propagation is a powerful approach to solving set-constraint satisfaction problems. However, prior BDD based techniques incur the si...
Graeme Gange, Peter J. Stuckey, Vitaly Lagoon
IMCSIT
2010
15 years 5 months ago
Enhanced Competitive Differential Evolution for Constrained Optimization
Abstract--The constrained optimization with differential evolution (DE) is addressed. A novel variant of competitive differential evolution with a hybridized search of feasibility ...
Josef Tvrdík, Radka Polakova
INLG
2010
Springer
15 years 5 months ago
Poly-co: An Unsupervised Co-reference Detection System
We describe our contribution to the Generation Challenge 2010 for the tasks of Named Entity Recognition and coreference detection (GREC-NER). To extract the NE and the referring e...
Eric Charton, Michel Gagnon, Benoît Ozell
CRYPTO
2003
Springer
156views Cryptology» more  CRYPTO 2003»
16 years 15 days ago
Fast Algebraic Attacks on Stream Ciphers with Linear Feedback
Many popular stream ciphers apply a filter/combiner to the state of one or several LFSRs. Algebraic attacks on such ciphers [10, 11] are possible, if there is a multivariate relat...
Nicolas Courtois