Sciweavers

4212 search results - page 714 / 843
» On Compressible Pairings and Their Computation
Sort
View
APPROX
2006
Springer
162views Algorithms» more  APPROX 2006»
15 years 10 months ago
Approximating Precedence-Constrained Single Machine Scheduling by Coloring
Abstract. This paper investigates the relationship between the dimension theory of partial orders and the problem of scheduling precedenceconstrained jobs on a single machine to mi...
Christoph Ambühl, Monaldo Mastrolilli, Ola Sv...
APPROX
2006
Springer
124views Algorithms» more  APPROX 2006»
15 years 10 months ago
Combinatorial Algorithms for Data Migration to Minimize Average Completion Time
The data migration problem is to compute an efficient plan for moving data stored on devices in a network from one configuration to another. It is modeled by a transfer graph, wher...
Rajiv Gandhi, Julián Mestre
ACNS
2006
Springer
167views Cryptology» more  ACNS 2006»
15 years 10 months ago
Public Key Cryptography Sans Certificates in Ad Hoc Networks
Abstract. Several researchers have proposed the use of threshold cryptographic model to enable secure communication in ad hoc networks without the need of a trusted center. In this...
Nitesh Saxena
DAGM
2006
Springer
15 years 10 months ago
Exploiting Low-Level Image Segmentation for Object Recognition
Abstract. A method for exploiting the information in low-level image segmentations for the purpose of object recognition is presented. The key idea is to use a whole ensemble of se...
Volker Roth, Björn Ommer
DGCI
2006
Springer
15 years 10 months ago
A Network Flow Algorithm for Binary Image Reconstruction from Few Projections
Tomography deals with the reconstruction of images from their projections. In this paper we focus on tomographic reconstruction of binary images (i.e., black-and-white) that do not...
Kees Joost Batenburg