4850 search results - page 177 / 970 » Approximate Data Structures with Applications |
151
click to vote
JMLR
2010
15 years 28 days ago
2010
Some online algorithms for linear classification model the uncertainty in their weights over the course of learning. Modeling the full covariance structure of the weights can prov...
158
click to vote
NIPS
2004
15 years 7 months ago
2004
This paper proposes a method for computing fast approximations to support vector decision functions in the field of object detection. In the present approach we are building on an...
162
click to vote
NIPS
2004
15 years 7 months ago
2004
Linear Discriminant Analysis (LDA) is a well-known method for feature extraction and dimension reduction. It has been used widely in many applications such as face recognition. Re...
149
click to vote
INFOCOM
2009
IEEE
16 years 24 days ago
2009
IEEE
—Sensor network localization is an instance of the NP-HARD graph realization problem. Thus, methods used in practice are not guaranteed to find the correct localization, even if...
162
click to vote
CIKM
2009
Springer
16 years 22 days ago
2009
Springer
We consider the problem of releasing a limited public view of a sensitive graph which reveals at least k edges per node. We are motivated by Facebook’s public search listings, w...