Sciweavers

410 search results - page 57 / 82
» Objective and Subjective Algorithms for Grouping Association...
Sort
View
KDD
2004
ACM
160views Data Mining» more  KDD 2004»
14 years 8 months ago
k-TTP: a new privacy model for large-scale distributed environments
Secure multiparty computation allows parties to jointly compute a function of their private inputs without revealing anything but the output. Theoretical results [2] provide a gen...
Bobi Gilburd, Assaf Schuster, Ran Wolff
KDD
2003
ACM
160views Data Mining» more  KDD 2003»
14 years 8 months ago
Playing hide-and-seek with correlations
We present a method for very high-dimensional correlation analysis. The method relies equally on rigorous search strategies and on human interaction. At each step, the method cons...
Chris Jermaine
CIKM
2010
Springer
13 years 6 months ago
Skyline query processing for uncertain data
Recently, several research efforts have addressed answering skyline queries efficiently over large datasets. However, this research lacks methods to compute these queries over un...
Mohamed E. Khalefa, Mohamed F. Mokbel, Justin J. L...
ICRA
2010
IEEE
259views Robotics» more  ICRA 2010»
13 years 5 months ago
RANSAC matching: Simultaneous registration and segmentation
The iterative closest points (ICP) algorithm is widely used for ego-motion estimation in robotics, but subject to bias in the presence of outliers. We propose a random sample conse...
Shao-Wen Yang, Chieh-Chih Wang, Chun-Hua Chang
CDC
2010
IEEE
196views Control Systems» more  CDC 2010»
13 years 2 months ago
Convergence and convergence rate of stochastic gradient search in the case of multiple and non-isolated extrema
The asymptotic behavior of stochastic gradient algorithms is studied. Relying on some results of differential geometry (Lojasiewicz gradient inequality), the almost sure pointconve...
Vladislav B. Tadic