Sciweavers

1066 search results - page 91 / 214
» Computing Private Set Operations with Linear Complexities
Sort
View
WAE
1998
118views Algorithms» more  WAE 1998»
14 years 11 months ago
Guarding Scenes against Invasive Hypercubes
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...
Mark de Berg, Haggai David, Matthew J. Katz, Mark ...
ATAL
2010
Springer
14 years 11 months ago
Strategy-proof allocation of multiple items between two agents without payments or priors
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...
Mingyu Guo, Vincent Conitzer
ICNP
1998
IEEE
15 years 2 months ago
Darwin: Customizable Resource Management for Value-Added Network Services
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...
Prashant R. Chandra, Allan Fisher, Corey Kosak, T....
CVPR
2007
IEEE
15 years 12 months ago
Learning Object Material Categories via Pairwise Discriminant Analysis
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...
Zhouyu Fu, Antonio Robles-Kelly
LATIN
2010
Springer
14 years 8 months ago
On Quadratic Threshold CSPs
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...
Per Austrin, Siavosh Benabbas, Avner Magen