Sciweavers

1464 search results - page 176 / 293
» On optimal anonymization for l -diversity
Sort
View
WSC
2001
15 years 7 months ago
Graphical methods for robust design of a semiconductor burn-in process
Discrete-event simulation is a common tool for the analysis of semiconductor manufacturing systems. With the aid of a simulation model, and in conjunction with sensitivity analysi...
Scott L. Rosen, Chad A. Geist, Daniel A. Finke, Jy...
NIPS
1996
15 years 7 months ago
Radial Basis Function Networks and Complexity Regularization in Function Learning
In this paper we apply the method of complexity regularization to derive estimation bounds for nonlinear function estimation using a single hidden layer radial basis function netwo...
Adam Krzyzak, Tamás Linder
GLOBECOM
2007
IEEE
15 years 6 months ago
A Gray-Code Type Bit Assignment Algorithm for Unitary Space-Time Constellations
Abstract— Many techniques for constructing unitary spacetime constellations have been proposed. To minimize bit-error rate (BER) in a wireless communication system, constellation...
Adam Panagos, Kurt L. Kosbar
AMC
2008
67views more  AMC 2008»
15 years 6 months ago
A nonconforming covolume method for elliptic problems
We consider a control volume(covolume) method for second order elliptic PDEs with the rotated-Q1 nonconforming finite element on rectangular grids. The coefficient may a variable,...
Yun K. Hyon, Ho J. Jang, Do Y. Kwak
DCC
2010
IEEE
15 years 6 months ago
The maximum size of a partial 3-spread in a finite vector space over GF(2)
Let n 3 be an integer, let Vn(2) denote the vector space of dimension n over GF(2), and let c be the least residue of n modulo 3. We prove that the maximum number of 3-dimensional...
Saad El-Zanati, H. Jordon, G. F. Seelinger, Papa S...