Sciweavers

687 search results - page 103 / 138
» Generalizing Dissimilarity Representations Using Feature Lin...
Sort
View
CORR
2010
Springer
200views Education» more  CORR 2010»
13 years 8 months ago
Unified Compression-Based Acceleration of Edit-Distance Computation
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic programming s...
Danny Hermelin, Gad M. Landau, Shir Landau, Oren W...
GECCO
2009
Springer
166views Optimization» more  GECCO 2009»
14 years 3 months ago
Genetic programming in the wild: evolving unrestricted bytecode
We describe a methodology for evolving Java bytecode, enabling the evolution of extant, unrestricted Java programs, or programs in other languages that compile to Java bytecode. B...
Michael Orlov, Moshe Sipper
SYNASC
2007
IEEE
136views Algorithms» more  SYNASC 2007»
14 years 2 months ago
Wikipedia-Based Kernels for Text Categorization
In recent years several models have been proposed for text categorization. Within this, one of the widely applied models is the vector space model (VSM), where independence betwee...
Zsolt Minier, Zalan Bodo, Lehel Csató
IDEAS
2005
IEEE
137views Database» more  IDEAS 2005»
14 years 2 months ago
Order-Sensitive XML Query Processing over Relational Sources: An Algebraic Approach
The XML data is order-sensitive. The order problem, that is how ordered XML documents and order-sensitive queries over it can be efficiently supported when mapped into the unorde...
Ling Wang, Song Wang, Brian Murphy, Elke A. Runden...
ACL
1998
13 years 10 months ago
The Berkeley FrameNet Project
FrameNet is a three-year NSF-supported project in corpus-based computational lexicography, now in its second year NSF IRI-9618838, Tools for Lexicon Building". The project�...
Collin F. Baker, Charles J. Fillmore, John B. Lowe