Sciweavers

2434 search results - page 7 / 487
» Algorithmic Randomness of Closed Sets
Sort
View
APPROX
2004
Springer
116views Algorithms» more  APPROX 2004»
15 years 2 months ago
Randomized Approximation Algorithms for Set Multicover Problems with Applications to Reverse Engineering of Protein and Gene Net
In this paper we investigate the computational complexity of a combinatorial problem that arises in the reverse engineering of protein and gene networks. Our contributions are as ...
Piotr Berman, Bhaskar DasGupta, Eduardo D. Sontag
WEA
2004
Springer
85views Algorithms» more  WEA 2004»
15 years 2 months ago
Faster Deterministic and Randomized Algorithms on the Homogeneous Set Sandwich Problem
A homogeneous set is a non-trivial, proper subset of a graph’s vertices such that all its elements present exactly the same outer neighborhood. Given two graphs, G1(V, E1), G2(V,...
Celina M. Herrera de Figueiredo, Guilherme Dias da...
CCS
2006
ACM
15 years 1 months ago
Finding the original point set hidden among chaff
In biometric identification, a fingerprint is typically represented as a set of minutiae which are 2D points. A method [4] to protect the fingerprint template hides the minutiae b...
Ee-Chien Chang, Ren Shen, Francis Weijian Teo