Sciweavers

2157 search results - page 167 / 432
» Binary ant algorithm
Sort
View
NAACL
2010
15 years 4 months ago
Efficient Parsing of Well-Nested Linear Context-Free Rewriting Systems
The use of well-nested linear context-free rewriting systems has been empirically motivated for modeling of the syntax of languages with discontinuous constituents or relatively f...
Carlos Gómez-Rodríguez, Marco Kuhlma...
ICASSP
2011
IEEE
14 years 10 months ago
A novel fast canonical-signed-digit conversion technique for multiplication
Abstract—Fast multiplication can be achieved by using canonical signed digit (CSD) to speed-up computations. Conversion to CSD is needed when the multiplier is not known a priori...
Rui Guo, Linda DeBrunner
155
Voted
ICIP
2009
IEEE
15 years 4 months ago
Light Speed Labeling for RISC architectures
This article introduces a fast algorithm for Connected Component Labeling of binary images called Light Speed Labeling. It is segment-based and a line-relative labeling that was e...
Lionel Lacassagne, Bertrand Zavidovique
ANTS
2006
Springer
93views Algorithms» more  ANTS 2006»
15 years 10 months ago
Testing Equivalence of Ternary Cubics
Let C be a smooth plane cubic curve with Jacobian E. We give a formula for the action of the 3-torsion of E on C, and explain how it is useful in studying the 3-Selmer group of an ...
Tom Fisher
ANTS
2006
Springer
73views Algorithms» more  ANTS 2006»
15 years 10 months ago
The Elliptic Curve Database for Conductors to 130000
Abstract. Tabulating elliptic curves has been carried out since the earliest days of machine computation in number theory. After some historical remarks, we report on significant r...
John Cremona