9997 search results - page 396 / 2000 » The case for crowd computing |
228
click to vote
IWPEC
2010
Springer
15 years 4 months ago
2010
Springer
We consider the computational complexity of a problem modeling bribery in the context of voting systems. In the scenario of Swap Bribery, each voter assigns a certain price for swa...
186
click to vote
DLT
2008
15 years 8 months ago
2008
A graph H is computable if there is a graph G = (V, E) isomorphic to H where the set V of vertices and the edge relation E are both computable. In this case G is called a computabl...
177
click to vote
ICCV
2003
IEEE
16 years 8 months ago
2003
IEEE
We address the problem of using external rotation information with uncalibrated video sequences. The main problem addressed is, what is the benefit of the orientation information ...
466
click to vote
RECOMB
2011
Springer
14 years 9 months ago
2011
Springer
One of the criteria for inferring a species tree from a collection of gene trees, when gene tree incongruence is assumed to be due to incomplete lineage sorting (ILS), is minimize ...
165
click to vote
ATAL
2005
Springer
16 years 10 days ago
2005
Springer
Intelligent agents in the quantum internet are supposed to operate on networked hybrid quantum computers to individually or jointly accomplish their goals by means of both classic...