1187 search results - page 95 / 238 » Computation in Extended Argumentation Frameworks |
117
click to vote
FOCS
2007
IEEE
15 years 5 months ago
2007
IEEE
We develop a new technique of proving lower bounds for the randomized communication complexity of boolean functions in the multiparty `Number on the Forehead' model. Our meth...
118
Voted
CORR
2010
Springer
15 years 1 months ago
2010
Springer
Capacitated Caching (CC) Games are motivated by P2P and web caching applications, and involve nodes on a network making strategic choices regarding the content to replicate in the...
131
click to vote
PVLDB
2011
14 years 8 months ago
2011
Studies find that at least 20% of web queries have local intent; and the fraction of queries with local intent that originate from mobile properties may be twice as high. The eme...
120
Voted
SIBGRAPI
2005
IEEE
15 years 7 months ago
2005
IEEE
Mathematical morphology was originally conceived as a set theoretic approach for the processing of binary images. Approaches that extend classical binary morphology to gray-scale ...
113
click to vote
TLCA
2005
Springer
15 years 7 months ago
2005
Springer
Cut elimination is a central result of the proof theory. This paper proposes a new approach for proving the theorem for Gentzen’s intuitionistic sequent calculus LJ, that relies ...