Sciweavers

886 search results - page 97 / 178
» Generalized Bezout Identity
Sort
View
KDD
2002
ACM
171views Data Mining» more  KDD 2002»
14 years 9 months ago
Mining complex models from arbitrarily large databases in constant time
In this paper we propose a scaling-up method that is applicable to essentially any induction algorithm based on discrete search. The result of applying the method to an algorithm ...
Geoff Hulten, Pedro Domingos
STOC
2001
ACM
134views Algorithms» more  STOC 2001»
14 years 9 months ago
Data-streams and histograms
Histograms are typically used to approximate data distributions. Histograms and related synopsis structures have been successful in a wide variety of popular database applications...
Sudipto Guha, Nick Koudas, Kyuseok Shim
MOBIHOC
2007
ACM
14 years 8 months ago
The multicast capacity of large multihop wireless networks
We consider wireless ad hoc networks with a large number of users. Subsets of users might be interested in identical information, and so we have a regime in which several multicas...
Srinivas Shakkottai, Xin Liu, R. Srikant
MOBIHOC
2003
ACM
14 years 8 months ago
ANODR: anonymous on demand routing with untraceable routes for mobile ad-hoc networks
In hostile environments, the enemy can launch traffic analysis against interceptable routing information embedded in routing messages and data packets. Allowing adversaries to tra...
Jiejun Kong, Xiaoyan Hong
SODA
2010
ACM
157views Algorithms» more  SODA 2010»
14 years 6 months ago
Testing monotone high-dimensional distributions
A monotone distribution P over a (partially) ordered domain assigns higher probability to y than to x if y x in the order. We study several natural problems concerning testing pr...
Ronitt Rubinfeld, Rocco A. Servedio