Sciweavers

5595 search results - page 433 / 1119
» Comparing Subsumption Optimizations
Sort
View
TCS
2008
15 years 6 months ago
The cost of offline binary search tree algorithms and the complexity of the request sequence
In evaluating the performance of online algorithms for search trees, one wants to compare them to the best offline algorithm available. In this paper we lower bound the cost of an...
Jussi Kujala, Tapio Elomaa
191
Voted
CCE
2005
15 years 6 months ago
Use of parallel computers in rational design of redundant sensor networks
A general method to design optimal redundant sensor network even in the case of one sensor failure and able to estimate process key parameters within a required accuracy is propos...
Carine Gerkens, Georges Heyen
TPDS
2008
76views more  TPDS 2008»
15 years 6 months ago
How to Choose a Timing Model
When employing a consensus algorithm for state machine replication, should one optimize for the case that all communication links are usually timely, or for fewer timely links? Do...
Idit Keidar, Alexander Shraer
179
Voted
JMM2
2007
119views more  JMM2 2007»
15 years 6 months ago
Color Image Compression with Modified Fractal Coding on Spiral Architecture
—The proposed approach (CICMFCSA), firstly, compose the one-plane image using the pixel’s trichromatic coefficients. One-plane image in traditional square structure is represen...
Nileshsingh V. Thakur, O. G. Kakde
166
Voted
TSP
2008
116views more  TSP 2008»
15 years 6 months ago
Fast Blind Separation of Long Mixture Recordings Using Multivariate Polynomial Identification
This correspondence presents new approaches for optimizing kurtosis-based separation criteria in the case of long mixture recordings. Our methods are based on a multivariate polyno...
Johan Thomas, Yannick Deville, Shahram Hosseini