Sciweavers

17 search results - page 1 / 4
» Effectively Absolute Continuity and Effective Jordan Decompo...
Sort
View
ENTCS
2002
61views more  ENTCS 2002»
13 years 4 months ago
Effectively Absolute Continuity and Effective Jordan Decomposability
Classically, any absolute continuous real function is of bounded variation and hence can always be expressed as a difference of two increasing continuous functions (socalled Jorda...
Xizhong Zheng, Robert Rettinger, Burchard von Brau...
ICDE
2006
IEEE
154views Database» more  ICDE 2006»
13 years 10 months ago
Efficient Image Classification on Vertically Decomposed Data
Organizing digital images into semantic categories is imperative for effective browsing and retrieval. In large image collections, an efficient algorithm is crucial to quickly cat...
Taufik Abidin, Aijuan Dong, Honglin Li, William Pe...
AUTOMATICA
2006
86views more  AUTOMATICA 2006»
13 years 4 months ago
Averaging of nonsmooth systems using dither
It was shown by Zames and Shneydor and later by Mossaheb that a high-frequency dither signal of a quite arbitrary shape can be used to narrow the effective nonlinear sector of Lip...
Luigi Iannelli, Karl Henrik Johansson, Ulf T. J&ou...
ICC
2008
IEEE
121views Communications» more  ICC 2008»
13 years 11 months ago
Maximization of Network Survival Time in the Event of Intelligent and Malicious Attacks
—It is not possible to ensure that a network is absolutely secure. Therefore, network operators must continually change their defense strategies to counter attackers who constant...
Po-Hao Tsang, Frank Yeong-Sung Lin, Chun-Wei Chen
NIPS
2004
13 years 6 months ago
Computing regularization paths for learning multiple kernels
The problem of learning a sparse conic combination of kernel functions or kernel matrices for classification or regression can be achieved via the regularization by a block 1-norm...
Francis R. Bach, Romain Thibaux, Michael I. Jordan