Sciweavers

400 search results - page 47 / 80
» Extended formulations in combinatorial optimization
Sort
View
CRYPTO
2007
Springer
133views Cryptology» more  CRYPTO 2007»
14 years 2 months ago
On Secure Multi-party Computation in Black-Box Groups
Abstract. We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function fG(x1, . . . , xn) = x1 · x...
Yvo Desmedt, Josef Pieprzyk, Ron Steinfeld, Huaxio...
CVPR
2000
IEEE
14 years 10 months ago
Dynamic Layer Representation with Applications to Tracking
A dynamic layer representation is proposed in this paper for tracking moving objects. Previous work on layered representations has largely concentrated on two-/multiframe batch fo...
Hai Tao, Harpreet S. Sawhney, Rakesh Kumar
FMCAD
2007
Springer
14 years 12 days ago
Improved Design Debugging Using Maximum Satisfiability
In today's SoC design cycles, debugging is one of the most time consuming manual tasks. CAD solutions strive to reduce the inefficiency of debugging by identifying error sourc...
Sean Safarpour, Hratch Mangassarian, Andreas G. Ve...
ICDM
2008
IEEE
115views Data Mining» more  ICDM 2008»
14 years 3 months ago
Toward Faster Nonnegative Matrix Factorization: A New Algorithm and Comparisons
Nonnegative Matrix Factorization (NMF) is a dimension reduction method that has been widely used for various tasks including text mining, pattern analysis, clustering, and cancer ...
Jingu Kim, Haesun Park
CVPR
2009
IEEE
15 years 3 months ago
Intrinsic Mean Shift for Clustering on Stiefel and Grassmann Manifolds
The mean shift algorithm, which is a nonparametric density estimator for detecting the modes of a distribution on a Euclidean space, was recently extended to operate on analytic ...
Hasan Ertan Çetingül, René Vida...