65 search results - page 13 / 13 » Getting Serious about the Development of Computational Humor |
KDD
2006
ACM
14 years 5 months ago
2006
ACM
Given a huge real graph, how can we derive a representative sample? There are many known algorithms to compute interesting measures (shortest paths, centrality, betweenness, etc.)...
ICFP
2008
ACM
14 years 4 months ago
2008
ACM
Command-oriented functional programs are currently structured in an ad hoc way that makes the development of multiple userinterfaces difficult and error prone, and makes it diffic...
ICPPW
2002
IEEE
13 years 9 months ago
2002
IEEE
generally meta-data, so that documents on any specific subject can be transparently retrieved. While quality control can in principle still rely on the traditional methods of peer-...
SODA
2012
ACM
11 years 7 months ago
2012
ACM
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...
EUROSYS
2010
ACM
13 years 11 months ago
2010
ACM
The deluge of huge data sets such as those provided by
sensor networks, online transactions, and the web provide
exciting opportunities for data analysis. The scale of the
data ...