Sciweavers

2252 search results - page 325 / 451
» Improving Random Forests
Sort
View
COCO
2009
Springer
124views Algorithms» more  COCO 2009»
14 years 5 months ago
The Maximum Communication Complexity of Multi-Party Pointer Jumping
—We study the one-way number-on-the-forhead (NOF) communication complexity of the k-layer pointer jumping problem. Strong lower bounds for this problem would have important impli...
Joshua Brody
FQAS
2009
Springer
129views Database» more  FQAS 2009»
14 years 5 months ago
Representing Context Information for Document Retrieval
The bag of words representation (BoW), which is widely used in information retrieval (IR), represents documents and queries as word lists that do not express anything about context...
Maya Carrillo, Esaú Villatoro-Tello, Aureli...
FSTTCS
2009
Springer
14 years 5 months ago
Non-Local Box Complexity and Secure Function Evaluation
ABSTRACT. A non-local box is an abstract device into which Alice and Bob input bits x and y respectively and receive outputs a and b respectively, where a, b are uniformly distribu...
Marc Kaplan, Iordanis Kerenidis, Sophie Laplante, ...
GECCO
2009
Springer
191views Optimization» more  GECCO 2009»
14 years 5 months ago
Evolvable malware
The concept of artificial evolution has been applied to numerous real world applications in different domains. In this paper, we use this concept in the domain of virology to ev...
Sadia Noreen, Shafaq Murtaza, M. Zubair Shafiq, Mu...
GECCO
2009
Springer
107views Optimization» more  GECCO 2009»
14 years 5 months ago
Swarming along the evolutionary branches sheds light on genome rearrangement scenarios
A genome rearrangement scenario describes a series of chromosome fusion, fission, and translocation operations that suffice to rewrite one genome into another. Exact algorithmic ...
Nikolay Vyahhi, Adrien Goëffon, Macha Nikolsk...