Sciweavers

1941 search results - page 337 / 389
» On the Hardness of Approximate Reasoning
Sort
View
RECOMB
2005
Springer
16 years 6 months ago
Learning Interpretable SVMs for Biological Sequence Classification
Background: Support Vector Machines (SVMs) ? using a variety of string kernels ? have been successfully applied to biological sequence classification problems. While SVMs achieve ...
Christin Schäfer, Gunnar Rätsch, Sö...
STOC
2004
ACM
134views Algorithms» more  STOC 2004»
16 years 6 months ago
Better extractors for better codes?
We present an explicit construction of codes that can be list decoded from a fraction (1 - ) of errors in sub-exponential time and which have rate / logO(1) (1/). This comes close...
Venkatesan Guruswami
MOBISYS
2007
ACM
16 years 5 months ago
SmokeScreen: flexible privacy controls for presence-sharing
Presence-sharing is an emerging platform for mobile applications, but presence-privacy remains a challenge. Privacy controls must be flexible enough to allow sharing between both ...
Landon P. Cox, Angela Dalton, Varun Marupadi
MOBIHOC
2008
ACM
16 years 5 months ago
The networking shape of vehicular mobility
Mobility is the distinguishing feature of vehicular networks, affecting the evolution of network connectivity over space and time in a unique way. Connectivity dynamics, in turn, ...
Marco Fiore, Jérôme Härri
MOBIHOC
2005
ACM
16 years 5 months ago
A secure ad-hoc routing approach using localized self-healing communities
Mobile ad hoc networks (MANETs) are vulnerable to routing attacks, especially attacks launched by non-cooperative (selfish or compromised) network members and appear to be protoco...
Jiejun Kong, Xiaoyan Hong, Yunjung Yi, Joon-Sang P...