2252 search results - page 199 / 451 » Improving Random Forests |
108
click to vote
ISSAC
2007
Springer
15 years 10 months ago
2007
Springer
A new randomized algorithm is presented for computing the characteristic polynomial of an n × n matrix over a field. Over a sufficiently large field the asymptotic expected com...
ISCAS
2006
IEEE
15 years 9 months ago
2006
IEEE
—This paper describes a 12-bit 300 MHz CMOS DAC for high-speed system applications. The proposed DAC consists of a unit current-cell matrix for 8 MSBs and a binaryweighted array ...
143
click to vote
IVA
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Background characters in virtual environments do not require the same amount of processing that is usually required by main characters, however we still want simulation t...
131
Voted
MFCS
2004
Springer
15 years 9 months ago
2004
Springer
We study the on-line versions of two fundamental graph problems, maximum independent set and minimum coloring, for the case of disk graphs which are graphs resulting from intersect...
110
Voted
AC
2003
Springer
15 years 9 months ago
2003
Springer
We suggest that a combination of randomization and gossip communication can be used to overcome scalability barriers that limit the utility of many technologies for distributed sys...