2168 search results - page 25 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
COMPGEOM
2010
ACM
13 years 11 months ago
2010
ACM
We give a provably correct algorithm to reconstruct a kdimensional manifold embedded in d-dimensional Euclidean space. Input to our algorithm is a point sample coming from an unkn...
MOBIHOC
2002
ACM
14 years 7 months ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
ICTAI
2003
IEEE
14 years 29 days ago
2003
IEEE
Computing and storing probabilities is a hard problem as soon as one has to deal with complex distributions over multiples random variables. The problem of efficient representati...
IHI
2010
13 years 2 months ago
2010
Regulations in various countries permit the reuse of health information without patient authorization provided the data is "de-identified". In the United States, for ins...
ICSE
2000
IEEE-ACM
13 years 11 months ago
2000
IEEE-ACM
Software's increasing role creates both requirements for being able to trust it more than before, and for more people to know how much they can trust their software. A sound ...