Sciweavers

739 search results - page 49 / 148
» Sorting Algorithms
Sort
View
CORR
2004
Springer
116views Education» more  CORR 2004»
13 years 8 months ago
Two Methods for Decreasing the Computational Complexity of the MIMO ML Decoder
We propose use of QR decomposition with sort and Dijkstra's algorithm for decreasing the computational complexity of the sphere decoder that is used for ML detection of signa...
Takayuki Fukatani, Ryutaroh Matsumoto, Tomohiko Uy...
ICDT
2009
ACM
121views Database» more  ICDT 2009»
14 years 9 months ago
Optimal splitters for database partitioning with size bounds
Partitioning is an important step in several database algorithms, including sorting, aggregation, and joins. Partitioning is also fundamental for dividing work into equal-sized (o...
Kenneth A. Ross, John Cieslewicz
EACL
1989
ACL Anthology
13 years 10 months ago
Expressing generalizations in unification-based grammar formalisms
This paper shows how higher levels of generalization can be introduced into unification grammars by exploiting methods for typing grammatical objects. We discuss the strategy of u...
Marc Moens, Jonathan Calder, Ewan Klein, Mike Reap...
ICCS
2004
Springer
14 years 2 months ago
Developing a Data Driven System for Computational Neuroscience
Abstract. A data driven system implies the need to integrate data acquisition and signal processing into the same system that will interact with this information. This can be done ...
Ross Snider, Yongming Zhu
CLIN
2003
13 years 10 months ago
Incremental Construction of Minimal Sequential Transducers
This paper presents an efficient algorithm for the incremental construction of a minimal acyclic sequential transducer (ST) from a list of input and output strings. The algorithm...
Wojciech Skut