1818 search results - page 225 / 364 » Granularity-Adaptive Proof Presentation |
130
click to vote
IPL
2007
15 years 3 months ago
2007
We study the circuit complexity of the powering function, defined as POWm(Z) = Zm for an n-bit integer input Z and an integer exponent m poly(n). Let LTd denote the class of func...
142
click to vote
TDSC
2008
15 years 3 months ago
2008
Inspired by unidirectional error detecting codes that are used in situations where only one kind of bit error is possible (e.g., it is possible to change a bit "0" into a...
140
click to vote
BMCBI
2005
15 years 3 months ago
2005
Background: Ambiguity is a problem in biosequence analysis that arises in various analysis tasks solved via dynamic programming, and in particular, in the modeling of families of ...
136
click to vote
JSAC
2007
15 years 3 months ago
2007
— We introduce a new version of the widely studied survivable mapping problem in IP-over-WDM networks. The new problem allows augmenting the given logical topology and is describ...
123
click to vote
CORR
2002
Springer
15 years 3 months ago
2002
Springer
A secure timeline is a tamper-evident historic record of the states through which a system goes throughout its operational history. Secure timelines can help us reason about the t...