Sciweavers

1464 search results - page 139 / 293
» On optimal anonymization for l -diversity
Sort
View
VLSISP
2002
83views more  VLSISP 2002»
15 years 6 months ago
Modulation and Coding for Noncoherent Communications
Until recently, the theory of noncoherent communications was premised on the use of orthogonal multi-pulse modulation such as frequency shift keying. The main drawback of this modu...
Michael L. McCloud, Mahesh K. Varanasi
PE
2008
Springer
173views Optimization» more  PE 2008»
15 years 6 months ago
M/G/1 queue with deterministic reneging times
We consider single-server and multi-server queues with deterministic reneging times motivated by the timeout mechanisms used in application servers.. A Volterra integral equation ...
Wei Xiong, David L. Jagerman, Tayfur Altiok
IPCO
2010
210views Optimization» more  IPCO 2010»
15 years 5 months ago
A 3-Approximation for Facility Location with Uniform Capacities
We consider the facility location problem where each facility can serve at most U clients. We analyze a local search algorithm for this problem which uses only the operations of ad...
Ankit Aggarwal, L. Anand, Manisha Bansal, Naveen G...
BMVC
2010
15 years 1 months ago
"How old are you?" : Age Estimation with Tensors of Binary Gaussian Receptive Maps
In this paper we describe experiments with a method to automatically estimate human age from facial images. This system extends recent results with the use of a tensorial represen...
John A. Ruiz-Hernandez, James L. Crowley, Augustin...
SIAMCOMP
2011
15 years 1 months ago
Self-Improving Algorithms
We investigate ways in which an algorithm can improve its expected performance by fine-tuning itself automatically with respect to an arbitrary, unknown input distribution. We gi...
Nir Ailon, Bernard Chazelle, Kenneth L. Clarkson, ...