2652 search results - page 494 / 531 » Privacy-preserving linear programming |
133
click to vote
CSFW
2009
IEEE
15 years 10 months ago
2009
IEEE
We consider using trust information to improve the anonymity provided by onion-routing networks. In particular, we introduce a model of trust in network nodes and use it to design...
134
click to vote
FOCS
2009
IEEE
15 years 10 months ago
2009
IEEE
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...
103
click to vote
FOCS
2009
IEEE
15 years 10 months ago
2009
IEEE
Given a set A of m agents and a set I of n items, where agent A ∈ A has utility uA,i for item i ∈ I, our goal is to allocate items to agents to maximize fairness. Specificall...
111
click to vote
ICASSP
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract—Hyperspectral unmixing aims at identifying the hidden spectral signatures (or endmembers) and their corresponding proportions (or abundances) from an observed hyperspect...
141
click to vote
INFOCOM
2009
IEEE
15 years 9 months ago
2009
IEEE
—We introduce a novel protection scheme, called Cooperative Fast Protection (CFP), to fight against a single link failure in survivable WDM (Wavelength Division Multiplexing) mes...