Sciweavers

536 search results - page 90 / 108
» Some Lower Bounds for the Complexity of Continuation Methods
Sort
View
DMIN
2009
121views Data Mining» more  DMIN 2009»
13 years 6 months ago
Data Mining in the Real World: Experiences, Challenges, and Recommendations
Abstract - Data mining is used regularly in a variety of industries and is continuing to gain in both popularity and acceptance. However, applying data mining methods to complex re...
Gary M. Weiss
PR
2007
293views more  PR 2007»
13 years 8 months ago
Mean shift-based clustering
In this paper, a mean shift-based clustering algorithm is proposed. The mean shift is a kernel-type weighted mean procedure. Herein, we first discuss three classes of Gaussian, C...
Kuo-Lung Wu, Miin-Shen Yang
EDBT
2006
ACM
156views Database» more  EDBT 2006»
14 years 3 days ago
FlexInd: A Flexible and Parameterizable Air-Indexing Scheme for Data Broadcast Systems
Abstract. In wireless data broadcast systems, popular information is repetitively disseminated through possibly multiple communication channels to mobile clients using various type...
André Seifert, Jen-Jou Hung
EDBT
2004
ACM
174views Database» more  EDBT 2004»
14 years 8 months ago
Processing Data-Stream Join Aggregates Using Skimmed Sketches
There is a growing interest in on-line algorithms for analyzing and querying data streams, that examine each stream element only once and have at their disposal, only a limited amo...
Sumit Ganguly, Minos N. Garofalakis, Rajeev Rastog...
CRYPTO
2004
Springer
120views Cryptology» more  CRYPTO 2004»
14 years 1 months ago
Round-Optimal Secure Two-Party Computation
Abstract. We consider the central cryptographic task of secure twoparty computation, where two parties wish to compute some function of their private inputs (each receiving possibl...
Jonathan Katz, Rafail Ostrovsky