Sciweavers

4208 search results - page 39 / 842
» Better Selection of the Best
Sort
View
ICIC
2009
Springer
13 years 8 months ago
Towards a Better Understanding of Random Forests through the Study of Strength and Correlation
In this paper we present a study on the Random Forest (RF) family of ensemble methods. From our point of view, a "classical" RF induction process presents two main drawba...
Simon Bernard, Laurent Heutte, Sébastien Ad...
ISSTA
2009
ACM
14 years 5 months ago
Exception analysis and points-to analysis: better together
Exception analysis and points-to analysis are typically done in complete separation. Past algorithms for precise exception analysis (e.g., pairing throw clauses with catch stateme...
Martin Bravenboer, Yannis Smaragdakis
APPROX
2007
Springer
160views Algorithms» more  APPROX 2007»
14 years 5 months ago
Better Binary List-Decodable Codes Via Multilevel Concatenation
We give a polynomial time construction of binary codes with the best currently known trade-off between rate and error-correction radius. Specifically, we obtain linear codes ove...
Venkatesan Guruswami, Atri Rudra
BTW
2005
Springer
91views Database» more  BTW 2005»
14 years 4 months ago
Element Relationship: Exploiting Inline Markup for Better XML Retrieval
: With the increasing popularity of semi-structured documents (particularly in the form of XML) for knowledge management, it is important to create tools that use the additional in...
Philipp Dopichaj
SODA
2008
ACM
185views Algorithms» more  SODA 2008»
14 years 12 days ago
Better bounds for online load balancing on unrelated machines
We study the problem of scheduling permanent jobs on unrelated machines when the objective is to minimize the Lp norm of the machine loads. The problem is known as load balancing ...
Ioannis Caragiannis