1322 search results - page 225 / 265 » Parameterized counting problems |
142
Voted
EMNLP
2010
15 years 1 months ago
2010
Determining whether a textual phrase denotes a functional relation (i.e., a relation that maps each domain element to a unique range element) is useful for numerous NLP tasks such...
150
Voted
CORR
2009
Springer
15 years 1 months ago
2009
Springer
The past research on the state complexity of operations on regular languages is examined, and a new approach based on an old method (derivatives of regular expressions) is presente...
167
Voted
KCAP
2011
ACM
14 years 6 months ago
2011
ACM
With billions of assertions and counting, the Web of Data represents the largest multi-contributor interlinked knowledge base that ever existed. We present a novel framework for a...
141
Voted
SODA
2012
ACM
13 years 6 months ago
2012
ACM
We present new quantum algorithms for Boolean Matrix Multiplication in both the time complexity and the query complexity settings. As far as time complexity is concerned, our resu...
143
Voted
MCS
2005
Springer
15 years 9 months ago
2005
Springer
Mixed Group Ranks is a parametric method for combining rank based classi ers that is eective for many-class problems. Its parametric structure combines qualities of voting methods...