Sciweavers

2435 search results - page 150 / 487
» Intellexer Question Answering
Sort
View
ECCC
2008
99views more  ECCC 2008»
15 years 3 months ago
Parallel Repetition in Projection Games and a Concentration Bound
In a two player game, a referee asks two cooperating players (who are not allowed to communicate) questions sampled from some distribution and decides whether they win or not base...
Anup Rao
117
Voted
CONEXT
2007
ACM
15 years 7 months ago
Folksonomy-based reasoning in opportunistic networks
Disparate algorithms are being designed to decide certain basic questions in opportunistic networks. This position paper describes a nascent idea that aims to provide a single fra...
Nishanth R. Sastry
111
Voted
IPL
2008
72views more  IPL 2008»
15 years 3 months ago
Turing degrees of reals of positive effective packing dimension
A relatively longstanding question in algorithmic randomness is Jan Reimann's question whether there is a Turing cone of broken dimension. That is, is there a real A such that...
Rod Downey, Noam Greenberg
CHI
2009
ACM
16 years 4 months ago
Some statistical analyses of CHI
In this paper I show a variety of ways to represent and think about statistical aspects of CHI and its sister conferences. In particular, I look at author counts, gender analysis,...
Joseph Kaye
147
Voted
CICLING
2009
Springer
15 years 10 months ago
The Value of Weights in Automatically Generated Text Structures
Abstract. One question that arises if we want to evolve generation techniques to accommodate Web ontologies is how to capture and expose the relevant ontology content to the user. ...
Dana Dannélls