Sciweavers

2489 search results - page 9 / 498
» On the Subgroup Distance Problem
Sort
View
HEURISTICS
2007
103views more  HEURISTICS 2007»
13 years 7 months ago
Distance measures based on the edit distance for permutation-type representations
In this paper, we develop and discuss several distance measures for permutation type representations of solutions of combinatorial optimisation problems. The problems discussed in...
Kenneth Sörensen
MOC
2000
84views more  MOC 2000»
13 years 7 months ago
Solving Thue equations without the full unit group
Abstract. The main problem when solving a Thue equation is the computation of the unit group of a certain number field. In this paper we show that the knowledge of a subgroup of fi...
Guillaume Hanrot
EUROCRYPT
2010
Springer
14 years 5 days ago
Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups
We develop an abstract framework that encompasses the key properties of bilinear groups of composite order that are required to construct secure pairing-based cryptosystems, and we...
David Mandell Freeman
NGC
2000
Springer
115views Communications» more  NGC 2000»
13 years 11 months ago
Hierarchical reliable multicast
The use of proxies for local error recovery and congestion control is a scalable technique used to overcome a number of wellknown problems in Reliable Multicast (RM). The idea is ...
Athina Markopoulou, Fouad A. Tobagi
IOR
2011
175views more  IOR 2011»
13 years 2 months ago
Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem
This paper introduces and studies the maximum k-plex problem, which arises in social network analysis and has wider applicability in several important areas employing graph-based ...
Balabhaskar Balasundaram, Sergiy Butenko, Illya V....