Sciweavers

11151 search results - page 5 / 2231
» On the Complexity of Model Expansion
Sort
View
ECCC
2008
117views more  ECCC 2008»
13 years 7 months ago
The complexity of learning SUBSEQ(A)
Higman essentially showed that if A is any language then SUBSEQ(A) is regular, where SUBSEQ(A) is the language of all subsequences of strings in A. Let s1, s2, s3, . . . be the sta...
Stephen A. Fenner, William I. Gasarch, Brian Posto...
ACL
2007
13 years 9 months ago
Statistical Machine Translation for Query Expansion in Answer Retrieval
We present an approach to query expansion in answer retrieval that uses Statistical Machine Translation (SMT) techniques to bridge the lexical gap between questions and answers. S...
Stefan Riezler, Alexander Vasserman, Ioannis Tsoch...
APPROX
2008
Springer
75views Algorithms» more  APPROX 2008»
13 years 9 months ago
On the Query Complexity of Testing Orientations for Being Eulerian
We consider testing directed graphs for being Eulerian in the orientation model introduced in [15]. Despite the local nature of the property of being Eulerian, it turns out to be ...
Eldar Fischer, Oded Lachish, Ilan Newman, Arie Mat...
CHI
2011
ACM
12 years 11 months ago
Collaborative creativity: a complex systems model with distributed affect
The study of creativity has received significant attention over the past century, with a recent increase in interest in collaborative, distributed creativity. We posit that creati...
Cecilia R. Aragon, Alison Williams
SAC
2009
ACM
14 years 2 months ago
Building an efficient preference XML query processor
Today user-centered information acquisition over collections of complex XML documents is increasingly in demand. To this end, preferences have become an important paradigm enablin...
SungRan Cho, Wolf-Tilo Balke