Sciweavers

5316 search results - page 342 / 1064
» Which Search Problems Are Random
Sort
View
SIGMOD
2007
ACM
232views Database» more  SIGMOD 2007»
16 years 7 months ago
BLINKS: ranked keyword searches on graphs
Query processing over graph-structured data is enjoying a growing number of applications. Keyword search on a graph finds a set of answers, each of which is a substructure of the ...
Haixun Wang, Hao He, Jun Yang 0001, Philip S. Yu
MM
2009
ACM
163views Multimedia» more  MM 2009»
16 years 1 months ago
CompositeMap: a novel music similarity measure for personalized multimodal music search
How to measure and model the similarity between different music items is one of the most fundamental yet challenging research problems in music information retrieval. This paper ...
Bingjun Zhang, Qiaoliang Xiang, Ye Wang, Jialie Sh...
CG
2002
Springer
15 years 7 months ago
PDS-PN: A New Proof-Number Search Algorithm
Abstract. The paper introduces a new proof-number (PN) search algorithm, called PDS-PN. It is a two-level search, which performs at the first level a depth-first Proof-number and D...
Mark H. M. Winands, Jos W. H. M. Uiterwijk, H. Jaa...
CEC
2009
IEEE
16 years 2 months ago
Representation and structural biases in CGP
— An evolutionary algorithm automatically discovers suitable solutions to a problem, which may lie anywhere in a large search space of candidate solutions. In the case of Genetic...
Andrew J. Payne, Susan Stepney
ECML
1998
Springer
15 years 11 months ago
A Monotonic Measure for Optimal Feature Selection
Feature selection is a problem of choosing a subset of relevant features. Researchers have been searching for optimal feature selection methods. `Branch and Bound' and Focus a...
Huan Liu, Hiroshi Motoda, Manoranjan Dash