402 search results - page 23 / 81 » Cryptosystems using Linear Groups |
CORR
2002
Springer
14 years 9 months ago
2002
Springer
Abstract. We investigate the average-case complexity of decision problems for finitely generated groups, in particular the word and membership problems. Using our recent results on...
4OR
2006
14 years 10 months ago
2006
This paper is based on the study of the set of nondecomposable integer solutions in a Gomory corner polyhedron, which was recently used in a reformulation method for integer linear...
102
click to vote
ASM
2005
ASM
15 years 3 months ago
2005
ASM
Abstract. Exploration algorithms are relevant to the industrial practice of gentest cases from an abstract state machine whose runs define the predicted behavior of the software s...
ICPP
2000
IEEE
15 years 2 months ago
2000
IEEE
This paper compares three similar loop-grouping methods. All methods are based on projecting the n-dimensional iteration space Jn onto a k-dimensional one, called the projected sp...
AVBPA
2001
Springer
15 years 2 months ago
2001
Springer
In several pattern recognition problems, particularly in image recognition ones, there are often a large number of features available, but the number of training samples for each p...