Sciweavers

1695 search results - page 299 / 339
» Linear, Polynomial or Exponential
Sort
View
99
Voted
PODS
1999
ACM
95views Database» more  PODS 1999»
15 years 5 months ago
Minimal Data Upgrading to Prevent Inference and Association
Despite advances in recent years in the area of mandatory access control in database systems, today's information repositories remain vulnerable to inference and data associa...
Steven Dawson, Sabrina De Capitani di Vimercati, P...
114
Voted
ASPDAC
1998
ACM
119views Hardware» more  ASPDAC 1998»
15 years 5 months ago
Integer Programming Models for Optimization Problems in Test Generation
— Test Pattern Generation for combinational circuits entails the identification of primary input assignments for detecting each fault in a set of target faults. An extension to ...
João P. Marques Silva
STOC
1998
ACM
190views Algorithms» more  STOC 1998»
15 years 5 months ago
Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces
We address the problem of designing data structures that allow efficient search for approximate nearest neighbors. More specifically, given a database consisting of a set of vecto...
Eyal Kushilevitz, Rafail Ostrovsky, Yuval Rabani
80
Voted
STACS
1998
Springer
15 years 5 months ago
On Disguised Double Horn Functions and Extensions
We consider Boolean functions represented by decision lists, and study their relationships to other classes of Boolean functions. It turns out that the elementary class of 1-decis...
Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
COMPGEOM
1993
ACM
15 years 4 months ago
Approximating Center Points with Iterated Radon Points
We give a practical and provably good Monte Carlo algorithm for approximating center points. Let P be a set of n points in IRd . A point c ∈ IRd is a β-center point of P if eve...
Kenneth L. Clarkson, David Eppstein, Gary L. Mille...