Sciweavers

29908 search results - page 249 / 5982
» On the Complexity of
Sort
View
CORR
2006
Springer
114views Education» more  CORR 2006»
15 years 6 months ago
Quasi-Orthogonal STBC With Minimum Decoding Complexity
- A new class of Quasi-Orthogonal Space-Time Block Code (QO-STBC) namely Minimum-DecodingComplexity QO-STBC (MDC-QOSTBC) has recently been proposed in the literature. In this paper...
Chau Yuen, Yong Liang Guan, Tjeng Thiang Tjhung
CORR
2006
Springer
122views Education» more  CORR 2006»
15 years 6 months ago
On the complexity of XPath containment in the presence of disjunction, DTDs, and variables
XPath is a simple language for navigating an XML-tree and returning a set of answer nodes. The focus in this paper is on the complexity of the containment problem for various frag...
Frank Neven, Thomas Schwentick
IJVR
2008
134views more  IJVR 2008»
15 years 6 months ago
An Educational Virtual Scenario for Learning Chaos and Complexity Theories
Based on contemporary Chaos and Complexity Theories, ImaginationTOOLSTM is an innovative Virtual Reality (VR) software architecture which, by means of an agent-based interface, end...
Francesca Bertacchini, Eleonora Bilotta, Pietro Pa...
CORR
2007
Springer
135views Education» more  CORR 2007»
15 years 6 months ago
On the decidability and complexity of Metric Temporal Logic over finite words
Abstract. Metric Temporal Logic (MTL) is a prominent specification formalism for realtime systems. In this paper, we show that the satisfiability problem for MTL over finite tim...
Joël Ouaknine, James Worrell
CORR
2007
Springer
109views Education» more  CORR 2007»
15 years 6 months ago
Multiresolution Approximation of Polygonal Curves in Linear Complexity
: We propose a new algorithm to the problem of polygonal curve approximation based on a multiresolution approach. This algorithm is suboptimal but still maintains some optimality b...
Pierre-Francois Marteau, Gildas Ménier