A filter method for the weighted local similarity search problemOHLEBUSCH, E.Lecture notes in computer science. 1997, pp 191-205, issn 0302-9743, isbn 3-540-63220-4Conference Paper

Best differential characteristic search of FEALAOKI, K; KOBAYASHI, K; MORIAI, S et al.Lecture notes in computer science. 1997, pp 41-53, issn 0302-9743, isbn 3-540-63247-6Conference Paper

New evolutionary direction operator for genetic3 algorithmsYAMAMOTO, K; INOUE, O.AIAA journal. 1995, Vol 33, Num 10, pp 1990-1993, issn 0001-1452Article

Evaluation of extended Stochastic Schemata ExploiterMARUYAMA, T; KITA, E.Transactions on the built environment. 2007, pp 45-53, isbn 978-1-8456-4070-5, 1Vol, 9 p.Conference Paper

Feature selection using consistency measureDASH, M; HAN LIU; MOTODA, H et al.Lecture notes in computer science. 1999, pp 319-320, issn 0302-9743, isbn 3-540-66713-XConference Paper

The block cipher SQUAREDAEMEN, J; KNUDSEN, L; RIJMEN, V et al.Lecture notes in computer science. 1997, pp 149-165, issn 0302-9743, isbn 3-540-63247-6Conference Paper

Visibility-based pursuit-evasion in a polygonal environmentGUIBAS, L. J; LATOMBE, J.-C; LAVALLE, S. M et al.Lecture notes in computer science. 1997, pp 17-30, issn 0302-9743, isbn 3-540-63307-3Conference Paper

Genetic subsets regression : Genetic algorithms and industrial engineeringSUDJIANTO, A; WASSERMAN, G. S; SUDARBO, H et al.Computers & industrial engineering. 1996, Vol 30, Num 4, pp 839-849, issn 0360-8352Article

Space and Time Efficient Algorithms for Planted Motif SearchDAVILA, Jaime; BALLA, Sudha; RAJASEKARAN, Sanguthevar et al.Lecture notes in computer science. 2006, pp 822-829, issn 0302-9743, isbn 3-540-34379-2, 8 p.Conference Paper

Writer recognition by using new searching algorithm in new local arc methodOZAKI, Masahiro; ADACHI, Yoshinori; ISHII, Naohiro et al.Lecture notes in computer science. 2005, issn 0302-9743, isbn 3-540-28894-5, vol1, 775-780Conference Paper

Web search steganalysis : Some challenges and approachesCHANDRAMOULI, R.IEEE International Symposium on Circuits and Systems. 2004, pp 576-579, isbn 0-7803-8251-X, 4 p.Conference Paper

Fast-search: A new efficient variant of the Boyer-Moore string matching algorithmCANTONE, Domenico; FARO, Simone.Lecture notes in computer science. 2003, pp 47-58, issn 0302-9743, isbn 3-540-40205-5, 12 p.Conference Paper

Improving linear cryptanalysis of LOKI91 by Probabilistic counting methodSAKURAI, K; FURUYA, S.Lecture notes in computer science. 1997, pp 114-133, issn 0302-9743, isbn 3-540-63247-6Conference Paper

CPM 2001 : combinatorial pattern matching (Jerusalem, 1-4 July 2001)Amir, Amihood; Landau, Gad M.Lecture notes in computer science. 2001, issn 0302-9743, isbn 3-540-42271-4, VIII, 271 p, isbn 3-540-42271-4Conference Proceedings

An efficient search method for large-vocabulary continuous-speech recognitionHANAZAWA, K; MINAMI, Y; FURUI, S et al.International conference on acoustics, speech, and signal processing. 1997, pp 1787-1790, isbn 0-8186-7919-0Conference Paper

Two 2D search filters and their performance analysesCHANG, C. C; LEU, J. J.International journal of computer mathematics. 1996, Vol 60, Num 3-4, pp 183-203, issn 0020-7160Article

A search for aliquot cycles and amicable pairsMOEWS, D; MOEWS, P. C.Mathematics of computation. 1993, Vol 61, Num 204, pp 935-938, issn 0025-5718Article

Discovering temporal rules from temporally ordered dataKARIMI, Kamran; HAMILTON, Howard J.Lecture notes in computer science. 2002, pp 25-30, issn 0302-9743, isbn 3-540-44025-9, 6 p.Conference Paper

Algebraic simplification techniques for propositional SatisfiabilityMARQUES-SILVA, Joan.Lecture notes in computer science. 2000, pp 537-542, issn 0302-9743, isbn 3-540-41053-8Conference Paper

The impact of branching heuristics in propositional satisfiability algorithmsMARQUES-SILVA, J.Lecture notes in computer science. 1999, pp 62-74, issn 0302-9743, isbn 3-540-66548-XConference Paper

A PC-based real-time large vocabulary continuous speech recognizer for GermanNIEMÖLLER, M; HAUENSTEIN, A; MARSCHALL, E et al.International conference on acoustics, speech, and signal processing. 1997, pp 1807-1810, isbn 0-8186-7919-0Conference Paper

A fast maximum finding algorithm on broadcast communicationSHIAU, S.-H; YANG, C.-B.Information processing letters. 1996, Vol 60, Num 2, pp 81-89, issn 0020-0190Article

Sur la réunion des arbres maximaux d'un graphe totalement préordonné. Note auto-critique = On the union of the maximal spanning trees of a completely preordered graph. A self-critical noteFLAMENT, C.Mathématiques, informatique et sciences humaines. 1993, Num 121, pp 35-40, issn 0995-2314Article

A test for additive decomposability of irreducibles over a finite fieldBRAWLEY, J. V; CARLITZ, L.Discrete mathematics. 1989, Vol 76, Num 1, pp 61-65, issn 0012-365XArticle

Performance guarantees on a sweep-line heuristic for covering rectilinear polygons with rectanglesFRANZBLAU, D. S.SIAM journal on discrete mathematics. 1989, Vol 2, Num 3, pp 307-321Article