Sciweavers

502 search results - page 42 / 101
» Streaming Random Forests
Sort
View
SODA
2008
ACM
111views Algorithms» more  SODA 2008»
13 years 11 months ago
On distance to monotonicity and longest increasing subsequence of a data stream
In this paper we consider problems related to the sortedness of a data stream. First we investigate the problem of estimating the distance to monotonicity; given a sequence of len...
Funda Ergün, Hossein Jowhari
ICDE
2005
IEEE
108views Database» more  ICDE 2005»
14 years 11 months ago
Range Efficient Computation of F0 over Massive Data Streams
Efficient one-pass computation of F0, the number of distinct elements in a data stream, is a fundamental problem arising in various contexts in databases and networking. We consid...
Pavan Aduri, Srikanta Tirthapura
ISVC
2007
Springer
14 years 4 months ago
Learning to Recognize Complex Actions Using Conditional Random Fields
Surveillance systems that operate continuously generate large volumes of data. One such system is described here, continuously tracking and storing observations taken from multiple...
Christopher I. Connolly
CRYPTO
2007
Springer
130views Cryptology» more  CRYPTO 2007»
14 years 4 months ago
A Security Analysis of the NIST SP 800-90 Elliptic Curve Random Number Generator
An elliptic curve random number generator (ECRNG) has been approved in a NIST standards and proposed for ANSI and SECG draft standards. This paper proves that, if three conjecture...
Daniel R. L. Brown, Kristian Gjøsteen
ICASSP
2010
IEEE
13 years 8 months ago
Random attributed graphs for statistical inference from content and context
Coping with Information Overload is a major challenge of the 21st century. Huge volumes and varieties of multilingual data must be processed to extract salient information. Previo...
Allen L. Gorin, Carey E. Priebe, John Grothendieck