Sciweavers

107 search results - page 14 / 22
» On the Optimal Selection of k in the k-Anonymity Problem
Sort
View
WCE
2007
13 years 9 months ago
An age artificial immune system for order pickings in an AS/RS with multiple I/O stations
— This paper proposes an age artificial immune system (AAIS), for optimal order pickings in an Automated Storage and Retrieval System (AS/RS) with multiple input/ output stations...
K. L. Mak, Peggy S. K. Lau
ASPDAC
2008
ACM
69views Hardware» more  ASPDAC 2008»
13 years 9 months ago
Fast, quasi-optimal, and pipelined instruction-set extensions
Nowadays many customised embedded processors offer the possibility of speeding up an application by implementing it using Application-Specific Functional units (AFUs). However, th...
Ajay K. Verma, Philip Brisk, Paolo Ienne
SODA
2010
ACM
144views Algorithms» more  SODA 2010»
13 years 6 months ago
Cell-Probe Lower Bounds for Succinct Partial Sums
The partial sums problem in succinct data structures asks to preprocess an array A[1 . . n] of bits into a data structure using as close to n bits as possible, and answer queries ...
Mihai Patrascu, Emanuele Viola
SECON
2010
IEEE
13 years 5 months ago
Utility-Based Gateway Deployment for Supporting Multi-Domain DTNs
Abstract--Due to technology or policy constraints, communications across network domains usually require the intervention of gateways, and their proper deployment is crucial to the...
Ting He, Kang-Won Lee, Nikoletta Sofra, Kin K. Leu...
RT
2005
Springer
14 years 1 months ago
Importance Resampling for Global Illumination
This paper develops importance resampling into a variance reduction technique for Monte Carlo integration. Importance resampling is a sample generation technique that can be used ...
Justin Talbot, David Cline, Parris K. Egbert