8196 search results - page 1488 / 1640 » Computational Modeling and Complexity Science |
134
Voted
ICS
2010
Tsinghua U.
16 years 1 months ago
2010
Tsinghua U.
We consider the problem of boosting the accuracy of weak learning algorithms in the agnostic learning framework of Haussler (1992) and Kearns et al. (1992). Known algorithms for t...
126
Voted
ICS
2010
Tsinghua U.
16 years 1 months ago
2010
Tsinghua U.
We introduce the notion of "non-malleable codes" which relaxes the notion of error-correction and errordetection. Informally, a code is non-malleable if the message cont...
134
Voted
ICDCS
2009
IEEE
16 years 26 days ago
2009
IEEE
Content sharing through vehicle-to-vehicle communication can help people find their interested content on the road. In VANETs, due to limited contact duration and unreliable wire...
170
Voted
FOSSACS
2009
Springer
15 years 10 months ago
2009
Springer
In this essay we discuss the origin, central results, and some perspectives of algorithmic synthesis of nonterminating reactive programs. We recall the fundamental questions raised...
160
Voted
ICST
2009
IEEE
15 years 10 months ago
2009
IEEE
It is challenging to test applications and functions for which the correct output for arbitrary input cannot be known in advance, e.g. some computational science or machine learni...