1385 search results - page 195 / 277 » Clustering by Random Projections |
138
click to vote
SIROCCO
2010
15 years 5 months ago
2010
Abstract. We study strategies that minimize the instability of a faulttolerant consensus system. More precisely, we find the strategy than minimizes the number of output changes ov...
133
click to vote
NIPS
2007
15 years 5 months ago
2007
We give a new class of outer bounds on the marginal polytope, and propose a cutting-plane algorithm for efficiently optimizing over these constraints. When combined with a concav...
112
click to vote
ECIS
2001
15 years 5 months ago
2001
A representative market study was carried out to determine the penetration of electronic business in Swiss companies. A random sample was used in which companies were classified b...
155
click to vote
GRAPHICSINTERFACE
2001
15 years 5 months ago
2001
Digital watermarking embeds a structure called watermark into the target data, such as image and 3D polygonal models. The watermark can be used, for example, to enforce copyright ...
CORR
2008
Springer
15 years 4 months ago
2008
Springer
The Karmarkar-Karp differencing algorithm is the best known polynomial time heuristic for the number partitioning problem, fundamental in both theoretical computer science and stat...