Sciweavers

1006 search results - page 195 / 202
» What is this page known for
Sort
View
CORR
2007
Springer
127views Education» more  CORR 2007»
13 years 8 months ago
Using decision problems in public key cryptography
There are several public key establishment protocols as well as complete public key cryptosystems based on allegedly hard problems from combinatorial (semi)group theory known by no...
Vladimir Shpilrain, Gabriel Zapata
JACM
2006
134views more  JACM 2006»
13 years 8 months ago
Online algorithms for market clearing
In this article, we study the problem of online market clearing where there is one commodity in the market being bought and sold by multiple buyers and sellers whose bids arrive an...
Avrim Blum, Tuomas Sandholm, Martin Zinkevich
EJC
2007
13 years 8 months ago
Quickly deciding minor-closed parameters in general graphs
We construct algorithms for deciding essentially any minor-closed parameter, with explicit time bounds. This result strengthens previous results by Robertson and Seymour [1,2], Fr...
Erik D. Demaine, Mohammad Taghi Hajiaghayi
PE
2008
Springer
167views Optimization» more  PE 2008»
13 years 8 months ago
Analysis of ratings on trust inference in open environments
Ratings (also known as recommendations) provide an efficient and effective way to build trust relationship in the human society, by making use of the information from others rathe...
Zhengqiang Liang, Weisong Shi
AML
2005
101views more  AML 2005»
13 years 8 months ago
Forcing and antifoundation
It is proved that the forcing apparatus can be built and set to work in ZFCA (=ZFC minus foundation plus the antifoundation axiom AFA). The key tools for this construction are gre...
Athanassios Tzouvaras