Sciweavers

207 search results - page 18 / 42
» The Polynomial Method for Random Matrices
Sort
View
CVPR
2012
IEEE
11 years 11 months ago
Random walks based multi-image segmentation: Quasiconvexity results and GPU-based solutions
We recast the Cosegmentation problem using Random Walker (RW) segmentation as the core segmentation algorithm, rather than the traditional MRF approach adopted in the literature s...
Maxwell D. Collins, Jia Xu, Leo Grady, Vikas Singh
SDM
2010
SIAM
195views Data Mining» more  SDM 2010»
13 years 10 months ago
MACH: Fast Randomized Tensor Decompositions
Tensors naturally model many real world processes which generate multi-aspect data. Such processes appear in many different research disciplines, e.g, chemometrics, computer visio...
Charalampos E. Tsourakakis
ICDM
2003
IEEE
98views Data Mining» more  ICDM 2003»
14 years 1 months ago
On the Privacy Preserving Properties of Random Data Perturbation Techniques
Privacy is becoming an increasingly important issue in many data mining applications. This has triggered the development of many privacy-preserving data mining techniques. A large...
Hillol Kargupta, Souptik Datta, Qi Wang, Krishnamo...
SDM
2010
SIAM
115views Data Mining» more  SDM 2010»
13 years 10 months ago
Reconstructing Randomized Social Networks
In social networks, nodes correspond to entities and edges to links between them. In most of the cases, nodes are also associated with a set of features. Noise, missing values or ...
Niko Vuokko, Evimaria Terzi
SAC
2010
ACM
14 years 3 months ago
Polytope-based computation of polynomial ranges
Polynomial ranges are commonly used for numerically solving polynomial systems with interval Newton solvers. Often ranges are computed using the convex hull property of the tensor...
Christoph Fünfzig, Dominique Michelucci, Sebt...