Sciweavers

1405 search results - page 66 / 281
» Popularity at Minimum Cost
Sort
View
OL
2011
217views Neural Networks» more  OL 2011»
14 years 4 months ago
Privacy-preserving linear programming
Abstract. We propose a privacy-preserving formulation of a linear program whose constraint matrix is partitioned into groups of columns where each group of columns and its correspo...
O. L. Mangasarian
ICASSP
2011
IEEE
14 years 1 months ago
Global convergence of independent component analysis based on semidefinite programming relaxation
In the independent component analysis, polynomial functions of higher order statistics are often used as cost functions. However, such cost functions usually have many local minim...
Shotaro Akaho, Jun Fujiki
ICASSP
2011
IEEE
14 years 1 months ago
Median filter with absolute value norm spatial regularization
We provide a novel formulation for computing median filter with spatial regularization as minimizing a cost function composed of absolute value norms. We turn this cost minimizat...
Nilanjan Ray
ICNP
2005
IEEE
15 years 3 months ago
Exploiting Dynamic Querying like Flooding Techniques in Unstructured Peer-to-Peer Networks
In unstructured peer-to-peer networks, controlled flooding aims at locating an item at the minimum message cost. Dynamic querying is a new controlled flooding technique. While i...
Hongbo Jiang, Shudong Jin
FSTTCS
2005
Springer
15 years 3 months ago
The Set Cover with Pairs Problem
Abstract. We consider a generalization of the set cover problem, in which elements are covered by pairs of objects, and we are required to find a minimum cost subset of objects th...
Refael Hassin, Danny Segev