3837 search results - page 121 / 768 » Learning Approximate Consistencies |
126
click to vote
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
We consider the problem of private efficient data mining of vertically-partitioned databases. Each of several parties holds a column of a data matrix (a vector) and the parties wan...
156
click to vote
SODA
2001
ACM
15 years 5 months ago
2001
ACM
Bin covering takes as input a list of items with sizes in (0 1) and places them into bins of unit demand so as to maximize the number of bins whose demand is satis ed. This is in ...
141
click to vote
SDM
2003
SIAM
15 years 5 months ago
2003
SIAM
In earlier work we have introduced and explored a variety of different probabilistic models for the problem of answering selectivity queries posed to large sparse binary data set...
169
click to vote
SIAMCOMP
1998
15 years 4 months ago
1998
Motivated by applications in computer graphics, visualization, and scienti c computation, we study the computational complexity of the following problem: Given a set S of n points...
113
click to vote
HICSS
2009
IEEE
15 years 11 months ago
2009
IEEE
One knowledge discovery problem in the rapid response setting is the cost of learning which patterns are indicative of a threat. This typically involves a detailed follow-through,...