10289 search results - page 40 / 2058 » Standard bases in K |
105
click to vote
JSA
2007
15 years 1 months ago
2007
— Hardware implementations of cryptographic algorithms are vulnerable to fault analysis attacks. Methods based on traditional fault-tolerant architectures are not suited for prot...
112
click to vote
EPIA
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. In social network analysis, a k-clique is a relaxed clique, i.e., a kclique is a quasi-complete sub-graph. A k-clique in a graph is a sub-graph where the distance between...
PRL
2006
15 years 1 months ago
2006
This paper addresses the supervised classification of remote-sensing images in problems characterized by relatively small-size training sets with respect to the input feature spac...
113
click to vote
MICS
2010
14 years 8 months ago
2010
In this paper we consider the k-fixed-endpoint path cover problem on proper interval graphs, which is a generalization of the path cover problem. Given a graph G and a set T of k v...
WDAG
2005
Springer
15 years 7 months ago
2005
Springer
This paper presents lower bounds on the time- and space-complexity of implementations that use the k compare-and-swap (k-CAS) synchronization primitives. We prove that the use of ...