5962 search results - page 174 / 1193 » Efficient Clustering for Orders |
168
click to vote
ASIACRYPT
2010
Springer
15 years 4 months ago
2010
Springer
In a recent work, Mangard et al. showed that under certain assumptions, the (so-called) standard univariate side-channel attacks using a distance-of-means test, correlation analysi...
211
click to vote
SIAMIS
2010
15 years 1 months ago
2010
We generalize the primal-dual hybrid gradient (PDHG) algorithm proposed by Zhu and Chan in [M. Zhu, and T. F. Chan, An Efficient Primal-Dual Hybrid Gradient Algorithm for Total Var...
149
click to vote
WEBI
2004
Springer
15 years 12 months ago
2004
Springer
In this paper, we particularly focused our attention on how to enhance expressivity of ontologies when used as organized space values in a catalogue request process. Using the Wis...
204
click to vote
ECCV
2008
Springer
16 years 8 months ago
2008
Springer
We show that the complexity of the recently introduced medoid-shift algorithm in clustering N points is O(N2 ), with a small constant, if the underlying distance is Euclidean. This...
194
click to vote
ITC
2003
IEEE
15 years 12 months ago
2003
IEEE
Scan-based architectures, though widely used in modern designs, are expensive in power consumption. In this paper, we present a new technique that allows to design power-optimized...