860 search results - page 8 / 172 » Lower Bounds on the Size of Test Data Sets |
JCS
2000
13 years 7 months ago
2000
Data mining introduces new problems in database security. The basic problem of using non-sensitive data to infer sensitive data is made more difficult by the "prob abilistic&...
DAC
1999
ACM
13 years 12 months ago
1999
ACM
Ordered Binary Decision Diagrams BDDs are a data structure for representation and manipulation of Boolean functions often applied in VLSI CAD. The choice of the variable orderin...
COCO
1999
Springer
13 years 12 months ago
1999
Springer
Recent work by Bernasconi, Damm and Shparlinski showed that the set of square-free numbers is not in AC0 , and raised as an open question whether similar (or stronger) lower bound...
ICDT
2009
ACM
14 years 8 months ago
2009
ACM
Partitioning is an important step in several database algorithms, including sorting, aggregation, and joins. Partitioning is also fundamental for dividing work into equal-sized (o...
ICDM
2006
IEEE
14 years 1 months ago
2006
IEEE
The k-means algorithm is a popular clustering method used in many different fields of computer science, such as data mining, machine learning and information retrieval. However, ...