2252 search results - page 229 / 451 » Improving Random Forests |
124
Voted
TON
2002
15 years 3 months ago
2002
A Bloom filter is a simple space-efficient randomized data structure for representing a set in order to support membership queries. Although Bloom filters allow false positives, f...
131
Voted
MVA
2007
15 years 2 months ago
2007
The application of a technique for labelling connected components based on the classical recursive technique is studied. The recursive approach permits labelling, counting, and cha...
110
Voted
JPDC
2010
15 years 1 months ago
2010
This paper shows that shared coin algorithms can be combined to optimize several complexity measures, even in the presence of a strong adversary. By combining shared coins of Brac...
113
Voted
MST
2010
15 years 1 months ago
2010
We study here the effect of concurrent greedy moves of players in atomic congestion games where n selfish agents (players) wish to select a resource each (out of m resources) so ...
124
Voted
ASPDAC
2010
ACM
15 years 1 months ago
2010
ACM
To cope with an increasing complexity when analyzing analog mismatch in sub-90nm designs, this paper presents a fast non-MonteCarlo method to calculate mismatch in time domain. Th...