Sciweavers

2485 search results - page 321 / 497
» Time Bounded Frequency Computations
Sort
View
FOCS
2005
IEEE
14 years 1 months ago
Concurrent Non-Malleable Commitments
We present a non-malleable commitment scheme that retains its security properties even when concurrently executed a polynomial number of times. That is, a manin-the-middle adversa...
Rafael Pass, Alon Rosen
HPCS
2005
IEEE
14 years 1 months ago
High Performance Derivative-Free Optimization Applied to Biomedical Image Registration
Abstract— Optimization of a similarity metric is an essential component in most medical image registration approaches based on image intensities. In this paper, two new, determin...
Mark P. Wachowiak, Terry M. Peters
ICDCS
2005
IEEE
14 years 1 months ago
Optimal Asynchronous Garbage Collection for RDT Checkpointing Protocols
Communication-induced checkpointing protocols that ensure rollback-dependency trackability (RDT) guarantee important properties to the recovery system without explicit coordinatio...
Rodrigo Schmidt, Islene C. Garcia, Fernando Pedone...
PDCAT
2005
Springer
14 years 1 months ago
Approximating Spanning Trees with Inner Nodes Cost
We consider the practical NP-complete problem of finding a minimum weight spanning tree with both edge weights and inner nodes weights. We present two polynomial time algorithms ...
Rudolf Fleischer, Qi Ge, Jian Li, Shijun Tian, Hai...
WG
2005
Springer
14 years 1 months ago
Algebraic Operations on PQ Trees and Modular Decomposition Trees
Partitive set families are families of sets that can be quite large, but have a compact, recursive representation in the form of a tree. This tree is a common generalization of PQ...
Ross M. McConnell, Fabien de Montgolfier