Sciweavers

3625 search results - page 115 / 725
» On choosing
Sort
View
PODS
2004
ACM
109views Database» more  PODS 2004»
16 years 6 months ago
On the Complexity of Optimal K-Anonymity
The technique of k-anonymization has been proposed in the literature as an alternative way to release public information, while ensuring both data privacy and data integrity. We p...
Adam Meyerson, Ryan Williams
ICFP
2004
ACM
16 years 6 months ago
Making a fast curry: push/enter vs. eval/apply for higher-order languages
Higher-order languages that encourage currying are implemented using one of two basic evaluation models: push/enter or eval/apply. Implementors use their intuition and qualitative...
Simon Marlow, Simon L. Peyton Jones
PERCOM
2008
ACM
16 years 6 months ago
An Algorithm for Distributed Beacon Selection
This paper investigates wireless sensor networks where a small percentage of nodes are assumed to know their location a priori. These reference nodes enable absolute localization ...
Dominik Lieckfeldt, Jiaxi You, Dirk Timmermann
ALT
2009
Springer
16 years 3 months ago
Learning Unknown Graphs
Motivated by a problem of targeted advertising in social networks, we introduce and study a new model of online learning on labeled graphs where the graph is initially unknown and...
Nicolò Cesa-Bianchi, Claudio Gentile, Fabio...
ALT
2006
Springer
16 years 3 months ago
Smooth Boosting Using an Information-Based Criterion
Abstract. Smooth boosting algorithms are variants of boosting methods which handle only smooth distributions on the data. They are proved to be noise-tolerant and can be used in th...
Kohei Hatano