5608 search results - page 356 / 1122 » On the Theory of Matchgate Computations |
206
click to vote
SEMCO
2009
IEEE
16 years 1 months ago
2009
IEEE
- Semantic processing represents the new challenge for all applications that require text understanding, as for instance Q/A. In this paper we will highlight the need to couple sta...
180
click to vote
ACMACE
2005
ACM
16 years 11 days ago
2005
ACM
Building upon research on motivation theory, we provide insights on how video games can be framed as expert tools that naturally reconcile learning and fun, a worthy goal since st...
206
click to vote
GROUP
2005
ACM
16 years 11 days ago
2005
ACM
Traditional activities change in surprising ways when computermediated communication becomes a component of the activity system. In this descriptive study, we leverage two perspec...
202
click to vote
COMPGEOM
2010
ACM
15 years 12 months 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 ...
200
click to vote
ATAL
2006
Springer
15 years 10 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...