16257 search results - page 2954 / 3252 » D-finiteness: algorithms and applications |
185
click to vote
ICS
2010
Tsinghua U.
16 years 4 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...
180
click to vote
EWSN
2010
Springer
16 years 3 months ago
2010
Springer
Abstract. Harsh deployment environments and uncertain run-time conditions create numerous challenges for postmortem time reconstruction methods. For example, motes often reboot and...
239
click to vote
ALT
2009
Springer
16 years 3 months ago
2009
Springer
Abstract. We analyze the expected cost of a greedy active learning algorithm. Our analysis extends previous work to a more general setting in which different queries have differe...
197
click to vote
ICCAD
2006
IEEE
16 years 3 months ago
2006
IEEE
Enumeration of bounded size cuts is an important step in several logic synthesis algorithms such as technology mapping and re-writing. The standard algorithm does not scale beyond...
199
click to vote
SOSP
2009
ACM
16 years 3 months ago
2009
ACM
This paper addresses the problem of scheduling concurrent jobs on clusters where application data is stored on the computing nodes. This setting, in which scheduling computations ...