5964 search results - page 382 / 1193 » A theory of speculative computation |
228
click to vote
COMPGEOM
2010
ACM
16 years 19 days ago
2010
ACM
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show that it is NP-hard to compute the crossing number of near-planar graphs. The main idea ...
226
click to vote
ATAL
2006
Springer
15 years 11 months ago
2006
Springer
Encouraging voters to truthfully reveal their preferences in an election has long been an important issue. Previous studies have shown that some voting protocols are hard to manip...
203
click to vote
ECCV
2004
Springer
15 years 11 months ago
2004
Springer
In this paper we develop a systematic theory about local structure of moving images in terms of Galilean differential invariants. We argue that Galilean invariants are useful for s...
206
click to vote
CORR
2004
Springer
15 years 7 months ago
2004
Springer
A growing body of literature in networked systems research relies on game theory and mechanism design to model and address the potential lack of cooperation between self-intereste...
182
click to vote
COLING
2000
15 years 9 months ago
2000
A translation is a conversion from a source language into a target language preserving the meaning. A huge number of techniques and computational approaches have been experimented...