Sciweavers

10289 search results - page 25 / 2058
» Standard bases in K
Sort
View
ISAAC
2009
Springer
175views Algorithms» more  ISAAC 2009»
15 years 8 months ago
Worst-Case and Smoothed Analysis of k-Means Clustering with Bregman Divergences
The k-means algorithm is the method of choice for clustering large-scale data sets and it performs exceedingly well in practice. Most of the theoretical work is restricted to the c...
Bodo Manthey, Heiko Röglin
IRI
2006
IEEE
15 years 8 months ago
T2K2: A type II KASER
—The transformational methodology described in this paper induces new knowledge, which may be open under any deductive process. The method of transposition is used to maintain a ...
Stuart Harvey Rubin, Shu-Ching Chen, James B. Law
ISCAS
2006
IEEE
129views Hardware» more  ISCAS 2006»
15 years 8 months ago
JPEG2000 for digital cinema
JPEG2000 is the latest international standard for image compression. It combines state of the art image compression performance with a rich feature set. JPEG2000 codestreams are h...
Ali Bilgin, Michael W. Marcellin
TCS
2008
15 years 1 months ago
A simple transitive signature scheme for directed trees
Transitive signatures allow a signer to authenticate edges in a graph in such a way that anyone, given the public key and two signatures on adjacent edges (i, j) and (j, k), can c...
Gregory Neven
PDCAT
2004
Springer
15 years 7 months ago
An Optimal Broadcasting Algorithm for de Bruijn Network dBG(d, k)
Recent works have classified de Bruijn graph (dBG) based broadcasting algorithms into local broadcasting and arc-disjoint spanning trees based broadcasting. However, those algorit...
Ngoc Chi Nguyen, Sungyoung Lee