Sciweavers

2713 search results - page 158 / 543
» Parameterized Tree Systems
Sort
View
120
Voted
GLOBECOM
2008
IEEE
15 years 3 months ago
An Efficient Tree Search for Reduced Complexity Sphere Decoding
The complexity of sphere decoding (SD) has been widely studied due to the importance of this algorithm in obtaining the optimal Maximum Likelihood (ML) performance with lower compl...
Luay Azzam, Ender Ayanoglu
111
Voted
ENTCS
2007
81views more  ENTCS 2007»
15 years 3 months ago
Self-assembling Trees
RCCS is a variant of Milner’s CCS where processes are allowed a controlled form of backtracking. It turns out that the RCCS reinterpretation of a CCS process is equivalent, in t...
Vincent Danos, Jean Krivine, Fabien Tarissan
136
Voted
NCA
2006
IEEE
15 years 3 months ago
Open-loop regulation and tracking control based on a genealogical decision tree
The goal of this paper is to design a new control algorithm for open-loop control of complex systems. This control approach is based on a genealogical decision tree for both regula...
Kaddour Najim, Enso Ikonen, P. Del Moral
95
Voted
CORR
2010
Springer
69views Education» more  CORR 2010»
15 years 3 months ago
The Isomorphism Relation Between Tree-Automatic Structures
An -tree-automatic structure is a relational structure whose domain and relations are accepted by Muller or Rabin tree automata. We investigate in this paper the isomorphism probl...
Olivier Finkel, Stevo Todorcevic
149
Voted
ICDE
2010
IEEE
288views Database» more  ICDE 2010»
16 years 3 months ago
Fast In-Memory XPath Search using Compressed Indexes
A large fraction of an XML document typically consists of text data. The XPath query language allows text search via the equal, contains, and starts-with predicates. Such predicate...
Diego Arroyuelo, Francisco Claude, Sebastian Manet...