1485 search results - page 175 / 297 » connection 2010 |
163
click to vote
WWW
2010
ACM
16 years 29 days ago
2010
ACM
Detecting clusters or communities in large real-world graphs such as large social or information networks is a problem of considerable interest. In practice, one typically chooses...
151
click to vote
STACS
2010
Springer
16 years 29 days ago
2010
Springer
Abstract. A Boolean function on N variables is called evasive if its decision-tree complexity is N. A sequence Bn of Boolean functions is eventually evasive if Bn is evasive for al...
155
click to vote
SIGECOM
2010
ACM
15 years 10 months ago
2010
ACM
We explore the striking mathematical connections that exist between market scoring rules, cost function based prediction markets, and no-regret learning. We first show that any c...
193
click to vote
CIE
2010
Springer
15 years 10 months ago
2010
Springer
Game semantics provides an interactive point of view on proofs, which enables one to describe precisely their dynamical behavior during cut elimination, by considering formulas as ...
188
click to vote
FUN
2010
Springer
15 years 10 months ago
2010
Springer
We study the complexity of the popular one player combinatorial game known as Flood-It. In this game the player is given an n×n board of tiles where each tile is allocated one of ...