2252 search results - page 223 / 451 » Improving Random Forests |
139
Voted
AP2PC
2004
Springer
15 years 9 months ago
2004
Springer
In a peer-to-peer (P2P) system, nodes typically connect to a small set of random nodes (their neighbors), and queries are propagated along these connections. Such query flooding t...
107
Voted
ECCV
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. Temporal random variation of luminance in images can manifest in film and video due to a wide variety of sources. Typical in archived films, it also affects scenes rec...
129
Voted
GD
2004
Springer
15 years 8 months ago
2004
Springer
We use Schnyder woods of 3-connected planar graphs to produce convex straight line drawings on a grid of size (n − 2 − ∆) × (n − 2 − ∆). The parameter ∆ ≥ 0 depen...
165
click to vote
ILP
2004
Springer
15 years 8 months ago
2004
Springer
One challenge faced by many Inductive Logic Programming (ILP) systems is poor scalability to problems with large search spaces and many examples. Randomized search methods such as ...
113
Voted
CSB
2003
IEEE
15 years 8 months ago
2003
IEEE
The design of large scale DNA microarrays is a challenging problem. So far, probe selection algorithms must trade the ability to cope with large scale problems for a loss of accur...