Sciweavers

5169 search results - page 173 / 1034
» Locality approximation using time
Sort
View
CDC
2010
IEEE
15 years 2 days ago
Stochastic approximation for consensus with general time-varying weight matrices
This paper considers consensus problems with delayed noisy measurements, and stochastic approximation is used to achieve mean square consensus. For stochastic approximation based c...
Minyi Huang
CIARP
2010
Springer
15 years 4 months ago
Improving the Dynamic Hierarchical Compact Clustering Algorithm by Using Feature Selection
Abstract. Feature selection has improved the performance of text clustering. In this paper, a local feature selection technique is incorporated in the dynamic hierarchical compact ...
Reynaldo Gil-García, Aurora Pons-Porrata
IPL
1998
119views more  IPL 1998»
15 years 4 months ago
A 2.5-Factor Approximation Algorithm for the k-MST Problem
The k-MST problem requires finding that subset of at least k vertices of a given graph whose Minimum Spanning Tree has least weight amongst all subsets of at least k vertices. Th...
Sunil Arya, H. Ramesh
TR
2008
81views more  TR 2008»
15 years 5 months ago
The Relationship Between Confidence Intervals for Failure Probabilities and Life Time Quantiles
The failure probability of a product F(t) and the life time quantile tp are commonly used metrics in reliability applications. Confidence intervals are used to quantify the statis...
Yili Hong, William Q. Meeker, Luis A. Escobar
129
Voted
IMA
2009
Springer
113views Cryptology» more  IMA 2009»
15 years 11 months ago
On Linear Cryptanalysis with Many Linear Approximations
Abstract. In this paper we present a theoretical framework to quantify the information brought by several linear approximations of a blockcipher without putting any restriction on ...
Benoît Gérard, Jean-Pierre Tillich