Sciweavers

502 search results - page 98 / 101
» Streaming Random Forests
Sort
View
ASIAN
2004
Springer
180views Algorithms» more  ASIAN 2004»
14 years 1 months ago
Counting by Coin Tossings
Abstract. This text is an informal review of several randomized algorithms that have appeared over the past two decades and have proved instrumental in extracting efficiently quant...
Philippe Flajolet
ISCC
2003
IEEE
153views Communications» more  ISCC 2003»
14 years 1 months ago
Fuzzy Explicit Marking for Congestion Control in Differentiated Services Networks
This paper presents a new active queue management scheme, Fuzzy Explicit Marking (FEM), implemented within the differentiated services (Diff-Serv) framework to provide congestion ...
Chrysostomos Chrysostomou, Andreas Pitsillides, Ge...
SENSYS
2003
ACM
14 years 1 months ago
Anchor-free distributed localization in sensor networks
Many sensor network applications require that each node’s sensor stream be annotated with its physical location in some common coordinate system. Manual measurement and configu...
Nissanka B. Priyantha, Hari Balakrishnan, Erik D. ...
SIGMOD
2010
ACM
173views Database» more  SIGMOD 2010»
14 years 1 months ago
PR-join: a non-blocking join achieving higher early result rate with statistical guarantees
Online aggregation is a promising solution to achieving fast early responses for interactive ad-hoc queries that compute aggregates on a large amount of data. Essential to the suc...
Shimin Chen, Phillip B. Gibbons, Suman Nath
INFOCOM
2000
IEEE
14 years 28 days ago
Analytic Evaluation of RED Performance
— End-to-end congestion control mechanisms such as those in TCP are not enough to prevent congestion collapse in the Internet (for starters, not all applications might be willing...
Thomas Bonald, Martin May, Jean-Chrysostome Bolot