64 search results - page 5 / 13 » First Order Random Forests with Complex Aggregates |
INFOCOM
2012
IEEE
12 years 12 months ago
2012
IEEE
—Collecting per-flow aggregates in high-speed links is challenging and usually requires traffic sampling to handle peak rates and extreme traffic mixes. Static selection of sa...
CORR
2010
Springer
14 years 6 months ago
2010
Springer
In this paper we derive aggregate separation bounds, named after Davenport-MahlerMignotte (DMM), on the isolated roots of polynomial systems, specifically on the minimum distance ...
184
click to vote
SIGMOD
2005
ACM
15 years 9 months ago
2005
ACM
While traditional database systems optimize for performance on one-shot queries, emerging large-scale monitoring applications require continuous tracking of complex aggregates and...
ACCV
2009
Springer
15 years 1 months ago
2009
Springer
Abstract. In this paper we present an efficient technique to obtain accurate semantic classification on the pixel level capable of integrating various modalities, such as color, ed...
APPROX
2008
Springer
14 years 11 months ago
2008
Springer
We study the problem of local search on a graph. Given a real-valued black-box function f on the graph's vertices, this is the problem of determining a local minimum of f--a v...