13603 search results - page 300 / 2721 » On the Complexity of Computing Treelength |
166
Voted
ECSQARU
2009
Springer
16 years 21 days ago
2009
Springer
Partially preordered belief bases are very convenient for an efficient representation of incomplete knowledge. They offer flexibility and avoid to compare unrelated pieces of inf...
161
click to vote
CNSR
2008
IEEE
16 years 18 days ago
2008
IEEE
Localizing tiny sensor nodes in large wireless sensor networks is extremely complex, due to the node’s strict resource limitations regarding memory size, processor performance a...
171
click to vote
GLOBECOM
2008
IEEE
16 years 18 days ago
2008
IEEE
— Recently, a maximum likelihood (ML) detection rule for differential unitary space time modulation (DUSTM) under the existence of unknown carrier frequency offset (CFO) has been...
192
click to vote
ICTAI
2008
IEEE
16 years 17 days ago
2008
IEEE
Unlike simple questions, complex questions cannot be answered by simply extracting named entities. These questions require inferencing and synthesizing information from multiple d...
150
click to vote
COCO
2007
Springer
16 years 9 days ago
2007
Springer
We study the link between the complexity of a polynomial and that of its coefficient functions. Valiant’s theory is a good setting for this, and we start by generalizing one of V...