Sciweavers

15777 search results - page 2870 / 3156
» Software Engineering
Sort
View
FSTTCS
2009
Springer
16 years 1 months ago
Iterative Methods in Combinatorial Optimization
We describe a simple iterative method for proving a variety of results in combinatorial optimization. It is inspired by Jain’s iterative rounding method (FOCS 1998) for designing...
R. Ravi
FSTTCS
2009
Springer
16 years 1 months ago
Non-Local Box Complexity and Secure Function Evaluation
ABSTRACT. A non-local box is an abstract device into which Alice and Bob input bits x and y respectively and receive outputs a and b respectively, where a, b are uniformly distribu...
Marc Kaplan, Iordanis Kerenidis, Sophie Laplante, ...
FSTTCS
2009
Springer
16 years 1 months ago
Approximating Fault-Tolerant Group-Steiner Problems
In this paper, we initiate the study of designing approximation algorithms for FaultTolerant Group-Steiner (FTGS) problems. The motivation is to protect the well-studied group-Ste...
Rohit Khandekar, Guy Kortsarz, Zeev Nutov
MODELS
2009
Springer
16 years 1 months ago
Domain analysis on an electronic health records system
Electronic Health Records (EHR) have been proposed as a means for managing the technical and organisational complexity that arises in modern healthcare. Different EHR systems are...
Xiaocheng Ge, Richard F. Paige, John A. McDermid
COMPGEOM
2009
ACM
16 years 1 months ago
Incremental construction of the delaunay triangulation and the delaunay graph in medium dimension
We describe a new implementation of the well-known incremental algorithm for constructing Delaunay triangulations in any dimension. Our implementation follows the exact computing ...
Jean-Daniel Boissonnat, Olivier Devillers, Samuel ...
« Prev « First page 2870 / 3156 Last » Next »