Sciweavers

4708 search results - page 932 / 942
» Generating the Structure of Argument
Sort
View
ML
2010
ACM
142views Machine Learning» more  ML 2010»
13 years 8 months ago
Fast adaptive algorithms for abrupt change detection
We propose two fast algorithms for abrupt change detection in streaming data that can operate on arbitrary unknown data distributions before and after the change. The first algor...
Daniel Nikovski, Ankur Jain
P2P
2010
IEEE
132views Communications» more  P2P 2010»
13 years 8 months ago
Towards Plugging Privacy Leaks in the Domain Name System
—Privacy leaks are an unfortunate and an integral part of the current Internet domain name resolution. Each DNS query generated by a user reveals – to one or more DNS servers ...
Yanbin Lu, Gene Tsudik
PVLDB
2010
118views more  PVLDB 2010»
13 years 8 months ago
Ten Thousand SQLs: Parallel Keyword Queries Computing
Keyword search in relational databases has been extensively studied. Given a relational database, a keyword query finds a set of interconnected tuple structures connected by fore...
Lu Qin, Jefferey Yu, Lijun Chang
RSA
2010
107views more  RSA 2010»
13 years 8 months ago
Continuum limits for classical sequential growth models
A random graph order, also known as a transitive percolation process, is defined by taking a random graph on the vertex set {0, . . . , n − 1}, and putting i below j if there i...
Graham Brightwell, Nicholas Georgiou
SEUS
2010
IEEE
13 years 8 months ago
Crash Recovery in FAST FTL
NAND flash memory is one of the non-volatile memories and has been replacing hard disk in various storage markets from mobile devices, PC/Laptop computers, even to enterprise serv...
Sungup Moon, Sang-Phil Lim, Dong-Joo Park, Sang-Wo...