Sciweavers

8728 search results - page 423 / 1746
» On Reduct Construction Algorithms
Sort
View
ANTS
2004
Springer
97views Algorithms» more  ANTS 2004»
16 years 8 days ago
Elliptic Curves with a Given Number of Points
We present a non-archimedean method to construct, given an integer N ≥ 1, a finite field Fq and an elliptic curve E/Fq such that E(Fq) has order N.
Reinier Bröker, Peter Stevenhagen
IJON
1998
46views more  IJON 1998»
15 years 6 months ago
Self-organizing maps of symbol strings
SOM and LVQ algorithms for symbol strings have been introduced and applied to isolatedword recognition, for the construction of an optimal pronunciation dictionary for a given spe...
Teuvo Kohonen, Panu Somervuo
ACL
2008
15 years 8 months ago
Inducing Gazetteers for Named Entity Recognition by Large-Scale Clustering of Dependency Relations
We propose using large-scale clustering of dependency relations between verbs and multiword nouns (MNs) to construct a gazetteer for named entity recognition (NER). Since dependen...
Jun'ichi Kazama, Kentaro Torisawa
SODA
2000
ACM
120views Algorithms» more  SODA 2000»
15 years 8 months ago
Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks
This paper shows that the minimum ratio canceling algorithm of Wallacher (1989) (and a faster relaxed version) can be generalized to an algorithm for general linear programs with ...
S. Thomas McCormick, Akiyoshi Shioura
BIRD
2007
Springer
128views Bioinformatics» more  BIRD 2007»
16 years 1 months ago
Efficient and Scalable Indexing Techniques for Biological Sequence Data
We investigate indexing techniques for sequence data, crucial in a wide variety of applications, where efficient, scalable, and versatile search algorithms are required. Recent res...
Mihail Halachev, Nematollaah Shiri, Anand Thamildu...