1322 search results - page 228 / 265 » Parameterized counting problems |
FSTTCS
2009
Springer
14 years 4 months ago
2009
Springer
ABSTRACT. We study functionally private approximations. An approximation function g is functionally private with respect to f if, for any input x, g(x) reveals no more information ...
CP
2007
Springer
14 years 4 months ago
2007
Springer
Abstract There has been considerable interest in the identification of structural properties of combinatorial problems that lead to efficient algorithms for solving them. Some of...
PPL
2007
13 years 9 months ago
2007
ract problem of using P failure-prone processors to cooperatively update all locations of an N-element shared array is called Write-All. Solutions to Write-All can be used iterati...
KDD
2009
ACM
14 years 10 months ago
2009
ACM
One common predictive modeling challenge occurs in text mining problems is that the training data and the operational (testing) data are drawn from different underlying distributi...
KSEM
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. Support Vector Machines (SVM) have been applied successfully in a wide variety of fields in the last decade. The SVM problem is formulated as a convex objective function...