2435 search results - page 376 / 487 » Intellexer Question Answering |
104
Voted
DM
2010
15 years 23 days ago
2010
A labeling of a graph G is distinguishing if it is only preserved by the trivial automorphism of G. The distinguishing chromatic number of G is the smallest integer k such that G ...
125
click to vote
ECCC
2010
15 years 23 days ago
2010
Assuming the existence of one-way functions, we show that there is no polynomial-time, differentially private algorithm A that takes a database D ({0, 1}d )n and outputs a "...
102
Voted
ECCC
2010
15 years 23 days ago
2010
The parallel repetition theorem states that for any Two Prover Game with value at most 1 - (for < 1/2), the value of the game repeated n times in parallel is at most (1 - 3 )(n...
EC
2008
15 years 23 days ago
2008
We present a statistical model of empirical optimization that admits the creation of algorithms with explicit and intuitively defined desiderata. Because No Free Lunch theorems di...
94
Voted
AIS
2006
Springer
15 years 23 days ago
2006
Springer
Artificial intelligence researchers interested in knowledge and in designing and implementing digitized artifacts for representing or sharing knowledge play a crucial role in the ...