Sciweavers

513 search results - page 71 / 103
» Reduction Transformations in ORM
Sort
View
AAIM
2009
Springer
118views Algorithms» more  AAIM 2009»
15 years 6 months ago
A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing
We introduce the s-Plex Editing problem generalizing the well-studied Cluster Editing problem, both being NP-hard and both being motivated by graph-based data clustering. Instead o...
Jiong Guo, Christian Komusiewicz, Rolf Niedermeier...
ICASSP
2008
IEEE
15 years 6 months ago
A detection algorithm for zero-quantized DCT coefficients in JPEG
The discrete cosine transform (DCT) is widely used in image/video coding standards. However, since most DCT coefficients will be quantized to zeros, a large number of redundant co...
Jin Li, Jarmo Takala, Moncef Gabbouj, Hexin Chen
WAIFI
2010
Springer
192views Mathematics» more  WAIFI 2010»
15 years 4 months ago
Type-II Optimal Polynomial Bases
In the 1990s and early 2000s several papers investigated the relative merits of polynomial-basis and normal-basis computations for F2n . Even for particularly squaring-friendly app...
Daniel J. Bernstein, Tanja Lange
PLDI
1998
ACM
15 years 4 months ago
Improving Performance by Branch Reordering
The conditional branch has long been considered an expensive operation. The relative cost of conditional branches has increased as recently designed machines are now relying on de...
Minghui Yang, Gang-Ryung Uh, David B. Whalley
ASPLOS
1994
ACM
15 years 3 months ago
Reducing Branch Costs via Branch Alignment
Several researchers have proposed algorithms for basic block reordering. We call these branch alignment algorithms. The primary emphasis of these algorithms has been on improving ...
Brad Calder, Dirk Grunwald