Sciweavers

10608 search results - page 110 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
GLOBECOM
2007
IEEE
14 years 4 months ago
Low Complexity Soft-Input Soft-Output Block Decision Feedback Equalization
— A low complexity soft-input soft-output (SISO) block decision feedback equalization (BDFE) algorithm is presented for Turbo equalization. Based on minimum mean square error (MM...
Jingxian Wu, Yahong Rosa Zheng
DATE
2005
IEEE
131views Hardware» more  DATE 2005»
14 years 3 months ago
Unified Modeling of Complex Real-Time Control Systems
Complex real-time control system is a software dense and algorithms dense system, which needs modern software engineering techniques to design. UML is an object-oriented industria...
He Hai, Zhong Yi-fang, Cai Chi-lan
ICALP
2004
Springer
14 years 3 months ago
Quantum Query Complexity of Some Graph Problems
Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for ...
Christoph Dürr, Mark Heiligman, Peter H&oslas...
ADBIS
2000
Springer
111views Database» more  ADBIS 2000»
14 years 2 months ago
Discovering Frequent Episodes in Sequences of Complex Events
Data collected in many applications have a form of sequences of events. One of the popular data mining problems is discovery of frequently occurring episodes in such sequences. Eff...
Marek Wojciechowski
FAW
2008
Springer
104views Algorithms» more  FAW 2008»
13 years 12 months ago
The Parameterized Complexity of the Rectangle Stabbing Problem and Its Variants
We study the parameterized complexity of an NP-complete geometric covering problem called d-dimensional Rectangle Stabbing where we are given a set of axis-parallel d-dimensional h...
Michael Dom, Somnath Sikdar