Sciweavers

435 search results - page 21 / 87
» Partitioning Search Spaces of a Randomized Search
Sort
View
ANCS
2006
ACM
15 years 1 months ago
Packet classification using coarse-grained tuple spaces
While the problem of high performance packet classification has received a great deal of attention in recent years, the research community has yet to develop algorithmic methods t...
Haoyu Song, Jonathan S. Turner, Sarang Dharmapurik...
90
Voted
ICDE
2007
IEEE
228views Database» more  ICDE 2007»
15 years 4 months ago
A General Cost Model for Dimensionality Reduction in High Dimensional Spaces
Similarity search usually encounters a serious problem in the high dimensional space, known as the “curse of dimensionality”. In order to speed up the retrieval efficiency, p...
Xiang Lian, Lei Chen 0002
69
Voted
APBC
2004
108views Bioinformatics» more  APBC 2004»
14 years 11 months ago
Ladderlike Stepping and Interval Jumping Searching Algorithms for DNA Sequences
In this study we have designed a novel algorithm for searching common segments in multiple DNA sequences. To improve efficiency in pattern searching, combination of hashing encodi...
Tun-Wen Pai, Margaret Dah-Tsyr Chang, Jia-Han Chu,...
EVOW
2004
Springer
15 years 3 months ago
A Hierarchical Social Metaheuristic for the Max-Cut Problem
This paper introduces a new social metaheuristic for the Max-Cut problem applied to a weighted undirected graph. This problem consists in finding a partition of the nodes into two ...
Abraham Duarte, Felipe Fernández, Án...
DSMML
2004
Springer
15 years 3 months ago
Redundant Bit Vectors for Quickly Searching High-Dimensional Regions
Applications such as audio fingerprinting require search in high dimensions: find an item in a database that is similar to a query. An important property of this search task is t...
Jonathan Goldstein, John C. Platt, Christopher J. ...