3055 search results - page 423 / 611 » Randomized Search Trees |
135
click to vote
CIKM
2009
Springer
15 years 11 months ago
2009
Springer
We investigate the problem of determining the polarity of sentiments when one or more occurrences of a negation term such as “not” appear in a sentence. The concept of the sco...
138
click to vote
GECCO
2009
Springer
15 years 11 months ago
2009
Springer
We propose a crossover operator that works with genetic programming trees and is approximately geometric crossover in the semantic space. By defining semantic as program’s eval...
135
click to vote
IWPEC
2009
Springer
15 years 10 months ago
2009
Springer
Many parameterized algorithms for NP-hard graph problems are search tree algorithms with sophisticated local branching rules. But it has also been noticed that the global structur...
162
click to vote
ICTAI
2008
IEEE
15 years 10 months ago
2008
IEEE
Unlike simple questions, complex questions cannot be answered by simply extracting named entities. These questions require inferencing and synthesizing information from multiple d...
119
click to vote
SISAP
2008
IEEE
15 years 10 months ago
2008
IEEE
Distance permutation indexes support fast proximity searching in high-dimensional metric spaces. Given some fixed reference sites, for each point in a database the index stores a...