Sciweavers

2089 search results - page 67 / 418
» A New Problem in String Searching
Sort
View
ICML
1994
IEEE
15 years 1 months ago
A Conservation Law for Generalization Performance
Conservation of information (COI) popularized by the no free lunch theorem is a great leveler of search algorithms, showing that on average no search outperforms any other. Yet in ...
Cullen Schaffer
PKDD
2004
Springer
205views Data Mining» more  PKDD 2004»
15 years 3 months ago
Breaking Through the Syntax Barrier: Searching with Entities and Relations
The next wave in search technology will be driven by the identification, extraction, and exploitation of real-world entities represented in unstructured textual sources. Search sy...
Soumen Chakrabarti
JCDL
2006
ACM
151views Education» more  JCDL 2006»
15 years 3 months ago
Tagging of name records for genealogical data browsing
In this paper we present a method of parsing unstructured textual records briefly describing a person and their direct relatives, which we use in the construction of a browsing t...
Mike Perrow, David Barber
GLOBECOM
2007
IEEE
15 years 4 months ago
Reduced Complexity Sphere Decoding for Square QAM via a New Lattice Representation
— Sphere decoding (SD) is a low complexity maximum likelihood (ML) detection algorithm, which has been adapted for different linear channels in digital communications. The comple...
Luay Azzam, Ender Ayanoglu
GECCO
2006
Springer
164views Optimization» more  GECCO 2006»
15 years 1 months ago
A new generation alternation model for differential evolution
We present a modified version of Differential Evolution (DE) for locating the global minimum at a higher convergence velocity. The proposed model differs from conventional DE by a...
Nasimul Noman, Hitoshi Iba