Sciweavers

7106 search results - page 878 / 1422
» Restricted Complexity, General Complexity
Sort
View
CCR
2007
86views more  CCR 2007»
15 years 7 months ago
An addressing independent networking structure favorable for all-optical packet switching
All-optical packet switching (AOPS) technology is essential to fully utilize the tremendous bandwidth provided by advanced optical communication techniques through forwarding pack...
Shengming Jiang
CORR
2007
Springer
173views Education» more  CORR 2007»
15 years 7 months ago
Computing modular polynomials in quasi-linear time
We analyse and compare the complexity of several algorithms for computing modular polynomials. We show that an algorithm relying on floating point evaluation of modular functions...
Andreas Enge
JCST
2008
175views more  JCST 2008»
15 years 7 months ago
Improved Approximate Detection of Duplicates for Data Streams Over Sliding Windows
Detecting duplicates in data streams is an important problem that has a wide range of applications. In general, precisely detecting duplicates in an unbounded data stream is not fe...
Hong Shen, Yu Zhang
CORR
2007
Springer
158views Education» more  CORR 2007»
15 years 7 months ago
Multi-group ML Decodable Collocated and Distributed Space Time Block Codes
Abstract— In this paper, collocated and distributed spacetime block codes (DSTBCs) which admit multi-group maximum likelihood (ML) decoding are studied. First the collocated case...
G. Susinder Rajan, B. Sundar Rajan
JMLR
2008
151views more  JMLR 2008»
15 years 7 months ago
Learning to Combine Motor Primitives Via Greedy Additive Regression
The computational complexities arising in motor control can be ameliorated through the use of a library of motor synergies. We present a new model, referred to as the Greedy Addit...
Manu Chhabra, Robert A. Jacobs