1464 search results - page 218 / 293 » On optimal anonymization for l -diversity |
160
click to vote
VLSID
2003
IEEE
16 years 6 months ago
2003
IEEE
In the previous work, the problem of nding gate delays to eliminate glitches has been solved by linear programs (LP) requiring an exponentially large number ofconstraints. By intr...
168
click to vote
RECOMB
2008
Springer
16 years 6 months ago
2008
Springer
The development of high-resolution microscopy makes possible the high-throughput screening of cellular information, such as gene expression at single cell resolution. One of the cr...
144
click to vote
STOC
2007
ACM
16 years 6 months ago
2007
ACM
We study the stability of the Max-Weight protocol for combined routing and scheduling in communication networks. Previous work has shown that this protocol is stable for adversari...
161
click to vote
ICFP
2003
ACM
16 years 6 months ago
2003
ACM
Lazy programs are beautiful, but they are slow because they build many thunks. Simple measurements show that most of these thunks are unnecessary: they are in fact always evaluate...
165
click to vote
MOBIHOC
2002
ACM
16 years 5 months ago
2002
ACM
Topology control problems are concerned with the assignment of power values to the nodes of an ad hoc network so that the power assignment leads to a graph topology satisfying som...