4908 search results - page 258 / 982 » On the Complexity of Optimal K-Anonymity |
162
click to vote
DCC
2003
IEEE
16 years 6 months ago
2003
IEEE
Practical applications that employ entropy coding for large alphabets often partition the alphabet set into two or more layers and encode each symbol by using some suitable prefix...
139
click to vote
MOBIHOC
2003
ACM
16 years 6 months ago
2003
ACM
In this paper we present GOAFR, a new geometric ad-hoc routing algorithm combining greedy and face routing. We evaluate this algorithm by both rigorous analysis and comprehensive ...
204
click to vote
ALT
2002
Springer
16 years 3 months ago
2002
Springer
We describe a new boosting algorithm that is the first such algorithm to be both smooth and adaptive. These two features make possible performance improvements for many learning ...
183
click to vote
CGO
2009
IEEE
16 years 1 months ago
2009
IEEE
Recent work has shown that machine learning can automate and in some cases outperform hand crafted compiler optimizations. Central to such an approach is that machine learning tec...
176
click to vote
BMEI
2008
IEEE
16 years 1 months ago
2008
IEEE
Multiple sequence alignment is the most fundamental task in bioinformatics and computational biology. In this paper, we present a new algorithm to conduct multiple sequences align...