697 search results - page 97 / 140 » Approximation of Information Granule Sets |
LATIN
2010
Springer
13 years 8 months ago
2010
Springer
The packet routing problem, i.e., the problem to send a given set of unit-size packets through a network on time, belongs to one of the most fundamental routing problems with impor...
SPIRE
2010
Springer
13 years 8 months ago
2010
Springer
The Longest Common Subsequence (LCS) of two or more strings is a fundamental well-studied problem which has a wide range of applications throughout computational sciences. When the...
WAIM
2010
Springer
13 years 8 months ago
2010
Springer
Trajectory prediction (TP) of moving objects has grown rapidly to be a new exciting paradigm. However, existing prediction algorithms mainly employ kinematical models to approximat...
TIT
2010
13 years 4 months ago
2010
We consider the asymmetric multilevel diversity (A-MLD) coding problem, where a set of 2 K 1 information sources, ordered in a decreasing level of importance, is encoded into K me...
ECCV
2006
Springer
14 years 11 months ago
2006
Springer
The paper introduces a new framework for feature learning in classification motivated by information theory. We first systematically study the information structure and present a n...