Sciweavers

418 search results - page 27 / 84
» On the Adders with Minimum Tests
Sort
View
SODA
1993
ACM
119views Algorithms» more  SODA 1993»
13 years 9 months ago
Iterated Nearest Neighbors and Finding Minimal Polytopes
We introduce a new method for nding several types of optimal k-point sets, minimizing perimeter, diameter, circumradius, and related measures, by testing sets of the O(k) nearest ...
David Eppstein, Jeff Erickson
VTC
2006
IEEE
124views Communications» more  VTC 2006»
14 years 1 months ago
Iterative Partial-Cancelling MMSE Algorithms for W-CDMA MIMO-BLAST Systems
—This paper focuses on the usage of an enhanced equalization-based receiver for WCDMA (Wideband CodeDivision Multiple Access) MIMO (Multiple Input, Multiple Output) BLAST (Bell L...
João Carlos Silva, Rui Dinis, Nuno Souto, F...
ACIVS
2005
Springer
14 years 1 months ago
Image De-Quantizing via Enforcing Sparseness in Overcomplete Representations
We describe a method for removing quantization artifacts (de-quantizing) in the image domain, by enforcing a high degree of sparseness in its representation with an overcomplete or...
Luis Mancera, Javier Portilla
IWDW
2005
Springer
14 years 1 months ago
The Return of the Sensitivity Attack
The sensitivity attack is considered as a serious threat to the security of spread-spectrum-based schemes, since it provides a practical method of removing watermarks with minimum ...
Pedro Comesaña, Luis Pérez-Freire, F...
KR
2004
Springer
14 years 1 months ago
An Experimental Analysis of Possibilistic Default Reasoning
This article provides an experimental analysis of the possibilistic handling of default rules. Three different nonmonotonic consequence relations are considered: minimum specifici...
Salem Benferhat, Jean-François Bonnefon, Ru...