2229 search results - page 70 / 446 » Comparative analysis of biclustering algorithms |
148
click to vote
COMCOM
2006
15 years 4 months ago
2006
We consider the problem of reliable data dissemination in the context of wireless sensor networks. For some application scenarios, reliable data dissemination to all nodes is nece...
137
click to vote
CN
2006
2006
A generic characterization of the overheads imposed by IPsec and associated cryptographic algorithms
15 years 4 months ago
This paper presents an assessment of the communication overheads of IPsec and evaluates the feasibility of deploying it on handheld devices for the UMTS architecture. A wide range...
137
click to vote
ICIAP
2001
Springer
16 years 4 months ago
2001
Springer
Deformable models are by their formulation able to solve surface extraction problem from noisy volumetric image data encountered commonly in medical image analysis. However, this ...
149
click to vote
INFORMATICALT
2006
15 years 4 months ago
2006
Matrix transpose in parallel systems typically involves costly all-to-all communications. In this paper, we provide a comparative characterization of various efficient algorithms f...
115
click to vote
IAJIT
2010
15 years 3 months ago
2010
: Warehouses scheduling is the problem of sequencing requests of products to fulfill several customers’ orders so as to minimize the average time and shipping costs. In this pape...