Sciweavers

1265 search results - page 12 / 253
» Finding the Key to a Synapse
Sort
View
JUCS
2010
160views more  JUCS 2010»
13 years 2 months ago
How Incomputable is Finding Nash Equilibria?
Abstract: We investigate the Weihrauch-degree of several solution concepts from noncooperative game theory. While the consideration of Nash equilibria forms the core of our work, a...
Arno Pauly
ICAIL
2009
ACM
14 years 2 months ago
Integrating induction and deduction for finding evidence of discrimination
Automatic Decision Support Systems (DSS) are widely adopted for screening purposes in socially sensitive tasks, including access to credit, mortgage, insurance, labor market and o...
Dino Pedreschi, Salvatore Ruggieri, Franco Turini
JCS
2010
104views more  JCS 2010»
13 years 6 months ago
Finding the PKI needles in the Internet haystack
Public-key cryptography can uniquely enable trust within distributed settings. Employing it usually requires deploying a set of tools and services collectively known as a public k...
Massimiliano Pala, Sean W. Smith
CIKM
2006
Springer
13 years 11 months ago
Annotation propagation revisited for key preserving views
This paper revisits the analysis of annotation propagation from source databases to views defined in terms of conjunctive (SPJ) queries. Given a source database D, an SPJ query Q,...
Gao Cong, Wenfei Fan, Floris Geerts
ICALP
1994
Springer
13 years 11 months ago
Finding Even Cycles Even Faster
We describe efficient algorithms for finding even cycles in undirected graphs. Our main results are the following: (i) For every k 2, there is an O(V 2) time algorithm that decide...
Raphael Yuster, Uri Zwick