Sciweavers

10901 search results - page 1880 / 2181
» Approximations in Distributed Optimization
Sort
View
KDD
2001
ACM
192views Data Mining» more  KDD 2001»
16 years 5 months ago
Data mining with sparse grids using simplicial basis functions
Recently we presented a new approach [18] to the classification problem arising in data mining. It is based on the regularization network approach but, in contrast to other method...
Jochen Garcke, Michael Griebel
133
Voted
STOC
2005
ACM
132views Algorithms» more  STOC 2005»
16 years 5 months ago
Concurrent general composition of secure protocols in the timing model
In the setting of secure multiparty computation, a set of parties wish to to jointly compute some function of their input (i.e., they wish to securely carry out some distributed t...
Yael Tauman Kalai, Yehuda Lindell, Manoj Prabhakar...
SIGMOD
2009
ACM
235views Database» more  SIGMOD 2009»
16 years 5 months ago
Quality and efficiency in high dimensional nearest neighbor search
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational data...
Yufei Tao, Ke Yi, Cheng Sheng, Panos Kalnis
SIGMOD
2008
ACM
138views Database» more  SIGMOD 2008»
16 years 5 months ago
Sampling time-based sliding windows in bounded space
Random sampling is an appealing approach to build synopses of large data streams because random samples can be used for a broad spectrum of analytical tasks. Users are often inter...
Rainer Gemulla, Wolfgang Lehner
SIGMOD
2006
ACM
219views Database» more  SIGMOD 2006»
16 years 5 months ago
Modeling skew in data streams
Data stream applications have made use of statistical summaries to reason about the data using nonparametric tools such as histograms, heavy hitters, and join sizes. However, rela...
Flip Korn, S. Muthukrishnan, Yihua Wu
« Prev « First page 1880 / 2181 Last » Next »