1248 search results - page 237 / 250 » Decision Tree Grafting |
143
click to vote
IPSN
2009
Springer
15 years 11 months ago
2009
Springer
We consider a scenario in which there are resources at or near nodes of a network, which are either static (e.g. fire stations, parking spots) or mobile (e.g. police cars). Over ...
131
click to vote
FOCS
2009
IEEE
15 years 10 months ago
2009
IEEE
We prove the existence of an algorithm A for computing 2-d or 3-d convex hulls that is optimal for every point set in the following sense: for every set S of n points and for ever...
162
click to vote
CAIP
2009
Springer
15 years 10 months ago
2009
Springer
This paper describes a comprehensive approach to extract a common feature set from the image sequences. We use simple features which are easily extracted from a 3D wireframe model ...
177
click to vote
COCO
2009
Springer
15 years 10 months ago
2009
Springer
—A simple averaging argument shows that given a randomized algorithm A and a function f such that for every input x, Pr[A(x) = f(x)] ≥ 1−ρ (where the probability is over the...
199
click to vote
SAGA
2009
Springer
15 years 10 months ago
2009
Springer
We propose a generic method for obtaining quickly good upper bounds on the minimal value of a multistage stochastic program. The method is based on the simulation of a feasible dec...