Sciweavers

333 search results - page 19 / 67
» Optimal sampling from distributed streams
Sort
View
WSC
1998
13 years 10 months ago
Stopping Criterion for a Simulation-Based Optimization Method
We consider a new simulation-based optimization method called the Nested Partitions (NP) method. This method generates a Markov chain and solving the optimization problem is equiv...
Sigurdur Ólafsson, Leyuan Shi
IJSN
2007
73views more  IJSN 2007»
13 years 8 months ago
Optimal worm-scanning method using vulnerable-host distributions
: Most Internet worms use random scanning. The distribution of vulnerable hosts on the Internet, however, is highly non-uniform over the IP-address space. This implies that random ...
Zesheng Chen, Chuanyi Ji
SIGMOD
2003
ACM
158views Database» more  SIGMOD 2003»
14 years 8 months ago
Processing Set Expressions over Continuous Update Streams
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. In ...
Sumit Ganguly, Minos N. Garofalakis, Rajeev Rastog...
MM
1994
ACM
151views Multimedia» more  MM 1994»
14 years 24 days ago
Distributed Parallel Data Storage Systems: A Scalable Approach to High Speed Image Servers
We have designed, built, and analyzed a distributed parallel storage system that will supply image streams fast enough to permit multi-user, "real-time", video-like appl...
Brian Tierney, Jason Lee, Ling Tony Chen, Hanan He...
ICML
2006
IEEE
14 years 9 months ago
Agnostic active learning
We state and analyze the first active learning algorithm which works in the presence of arbitrary forms of noise. The algorithm, A2 (for Agnostic Active), relies only upon the ass...
Maria-Florina Balcan, Alina Beygelzimer, John Lang...