Sciweavers

1464 search results - page 245 / 293
» On optimal anonymization for l -diversity
Sort
View
ESWA
2006
86views more  ESWA 2006»
15 years 6 months ago
Modeling consumer acceptance probabilities
This paper investigates how to estimate the likelihood of a customer accepting a loan offer as a function of the offer parameters and how to choose the optimal set of parameters f...
L. C. Thomas, Ki Mun Jung, Steve D. Thomas, Y. Wu
CORR
2007
Springer
88views Education» more  CORR 2007»
15 years 6 months ago
Target assignment for robotic networks: asymptotic performance under limited communication
— We are given an equal number of mobile robotic agents, and distinct target locations. Each agent has simple integrator dynamics, a limited communication range, and knowledge of...
Stephen L. Smith, Francesco Bullo
ISCA
2006
IEEE
92views Hardware» more  ISCA 2006»
15 years 6 months ago
Quantum Memory Hierarchies: Efficient Designs to Match Available Parallelism in Quantum Computing
The assumption of maximum parallelism support for the successful realization of scalable quantum computers has led to homogeneous, "sea-of-qubits" architectures. The res...
Darshan D. Thaker, Tzvetan S. Metodi, Andrew W. Cr...
JSAC
2008
85views more  JSAC 2008»
15 years 6 months ago
A distributed minimum variance estimator for sensor networks
A distributed estimation algorithm for sensor networks is proposed. A noisy time-varying signal is jointly tracked by a network of sensor nodes, in which each node computes its es...
Alberto Speranzon, Carlo Fischione, Karl Henrik Jo...
MANSCI
2008
68views more  MANSCI 2008»
15 years 6 months ago
Queuing for Expert Services
We consider a monopolist expert offering a service with a `credence' characteristic. A credence service is one where the customer cannot verify, even after a purchase, whethe...
Laurens G. Debo, L. Beril Toktay, Luk N. Van Wasse...