1068 search results - page 9 / 214 » For completeness, sublogarithmic space is no space |
CONTEXT
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We discuss a membrane-based calculus for the combination of conceptual spaces during runtime. Since our goal is to support emergent properties of behavior (and due to the...
ECCC
2008
13 years 7 months ago
2008
We obtain the first nontrivial time-space lower bound for quantum algorithms solving problems related to satisfiability. Our bound applies to MajSAT and MajMajSAT, which are compl...
EMNLP
2009
13 years 5 months ago
2009
Many algorithms extract terms from text together with some kind of taxonomic classification (is-a) link. However, the general approaches used today, and specifically the methods o...
EACL
2006
ACL Anthology
13 years 8 months ago
2006
ACL Anthology
This work is concerned with the space of alignments searched by word alignment systems. We focus on situations where word re-ordering is limited by syntax. We present two new alig...
ICRA
2010
IEEE
13 years 6 months ago
2010
IEEE
Abstract— We present a proof for the probabilistic completeness of RRT-based algorithms when planning with constraints on end-effector pose. Pose constraints can induce lowerdime...