128 search results - page 18 / 26 » ants 2006 |
ANTS
2006
Springer
15 years 1 months ago
2006
Springer
This paper suggests a new building block for cryptographic protocols and gives two instantiations of it. The concept is to generate two descriptions of the same group: a public des...
EVOW
2006
Springer
15 years 1 months ago
2006
Springer
The k-cut problem is an NP-complete problem which consists of finding a partition of a graph into k balanced parts such that the number of cut edges is minimized. Different algori...
ECTEL
2006
Springer
15 years 1 months ago
2006
Springer
The experience described in this paper is being developed in the framework of the PALETTE1 project by two teams of researchers involved in collecting information from some Communi...
104
click to vote
AROBOTS
2006
14 years 10 months ago
2006
How can a mobile robot measure the area of a closed region that is beyond its immediate sensing range? This problem, which we name as blind area measurement, is inspired from scout...
AINA
2006
IEEE
15 years 3 months ago
2006
IEEE
Multiple sequence alignment is an important and difficult problem in molecular biology and bioinformatics. In this paper, we propose a partitioning approach that significantly impr...