1403 search results - page 11 / 281 » About Approximations of Exponentials |
STACS
2005
Springer
15 years 2 months ago
2005
Springer
Exponential algorithms, i.e. algorithms of complexity O(cn ) for some c > 1, seem to be unavoidable in the case of NP-complete problems (unless P=NP), especially if the problem ...
ICITA
2005
IEEE
15 years 3 months ago
2005
IEEE
Optimum theorems for combining QoS metrics to reduce computation time in nodes (routers) is proposed based on fundamental theorems on QoS metrics. The proposed theorems unify sele...
85
Voted
INFORMATICALT
2006
14 years 9 months ago
2006
We know the necessity for information security becomes more widespread in these days, especially for hardware-based implementations such as smart cards chips for wireless applicati...
66
Voted
COLT
2007
Springer
15 years 3 months ago
2007
Springer
We give an algorithm for the on-line learning of permutations. The algorithm maintains its uncertainty about the target permutation as a doubly stochastic weight matrix, and makes...
LPAR
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Permutative logic (PL) is a noncommutative variant of multiplicative linear logic (MLL) arising from recent investigations concerning the topology of linear proofs. Permu...