Sciweavers

1464 search results - page 40 / 293
» On optimal anonymization for l -diversity
Sort
View
SIGCOMM
2009
ACM
15 years 6 months ago
Optimizing the BSD routing system for parallel processing
The routing architecture of the original 4.4BSD [3] kernel has been deployed successfully without major design modification for over 15 years. In the unified routing architectur...
Qing Li, Kip Macy
DCOSS
2005
Springer
15 years 5 months ago
Stably Computable Properties of Network Graphs
We consider a scenario in which anonymous, finite-state sensing devices are deployed in an ad-hoc communication network of arbitrary size and unknown topology, and explore what p...
Dana Angluin, James Aspnes, Melody Chan, Michael J...
ICCAD
1999
IEEE
76views Hardware» more  ICCAD 1999»
15 years 4 months ago
Optimal allocation of carry-save-adders in arithmetic optimization
: Carry-save-adder(CSA) is one of the most widely used schemes for fast arithmetic in industry. This paper provides a solution to the problem of finding an optimal-timing allocatio...
Junhyung Um, Taewhan Kim, C. L. Liu
CORR
2010
Springer
116views Education» more  CORR 2010»
14 years 12 months ago
Adaptive Bound Optimization for Online Convex Optimization
We introduce a new online convex optimization algorithm that adaptively chooses its regularization function based on the loss functions observed so far. This is in contrast to pre...
H. Brendan McMahan, Matthew J. Streeter
PE
2006
Springer
80views Optimization» more  PE 2006»
14 years 11 months ago
Sojourn time approximations in queueing networks with feedback
Bart M. M. Gijsen, Robert D. van der Mei, P. Engel...