1199 search results - page 95 / 240 » Parameterized Proof Complexity |
GRAMMARS
2002
13 years 9 months ago
2002
Recent models of natural language processing employ statistical reasoning for dealing with the ambiguity of formal grammars. In this approach, statistics, concerning the various li...
INFOCOM
2009
IEEE
14 years 4 months ago
2009
IEEE
Abstract—We study the joint power control and minimumframe-length scheduling problem in wireless networks, under the physical interference model and subject to consecutive transm...
ICC
2007
IEEE
14 years 4 months ago
2007
IEEE
— An interferometric ranging technique has been recently proposed as a possible way to localize ad hoc and sensor networks. Compared to the more common techniques such as receive...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
Deciding whether a graph can be embedded in a grid using only unitlength edges is NP-complete, even when restricted to binary trees. However, it is not difficult to devise a numbe...
ICALP
2005
Springer
14 years 3 months ago
2005
Springer
This paper presents several advances in the understanding of dynamic data structures in the bit-probe model: – We improve the lower bound record for dynamic language membership p...