1066 search results - page 91 / 214 » Computing Private Set Operations with Linear Complexities |
126
Voted
WAE
1998
15 years 4 months ago
1998
In recent years realistic input models for geometric algorithms have been studied. The most important models introduced are fatness, low density, unclutteredness, and small simple...
127
Voted
ATAL
2010
Springer
15 years 3 months ago
2010
Springer
We investigate the problem of allocating items (private goods) among competing agents in a setting that is both prior-free and paymentfree. Specifically, we focus on allocating mu...
128
Voted
ICNP
1998
IEEE
15 years 7 months ago
1998
IEEE
The Internet is rapidly changing from a set of wires and switches that carry packets into a sophisticated infrastructure that delivers a set of complex value-added services to end...
120
Voted
CVPR
2007
IEEE
16 years 4 months ago
2007
IEEE
In this paper, we investigate linear discriminant analysis (LDA) methods for multiclass classification problems in hyperspectral imaging. We note that LDA does not consider pairwi...
136
Voted
LATIN
2010
Springer
15 years 1 months ago
2010
Springer
A predicate P : {−1, 1}k → {0, 1} can be associated with a constraint satisfaction problem Max CSP(P). P is called “approximation resistant” if Max CSP(P) cannot be approxi...