Sciweavers

4622 search results - page 813 / 925
» Foundations of Information Theory
Sort
View
ACMSE
2010
ACM
14 years 9 months ago
Learning to rank using 1-norm regularization and convex hull reduction
The ranking problem appears in many areas of study such as customer rating, social science, economics, and information retrieval. Ranking can be formulated as a classification pro...
Xiaofei Nan, Yixin Chen, Xin Dang, Dawn Wilkins
CDC
2010
IEEE
116views Control Systems» more  CDC 2010»
14 years 9 months ago
A stochastic control approach to coding with feedback over degraded broadcast channels
In this paper we attempt to further demonstrate connections between information theory and control, in a networked setting. Specifically, we consider the communication problem of b...
Siva K. Gorantla, Todd P. Coleman
CDC
2010
IEEE
226views Control Systems» more  CDC 2010»
14 years 9 months ago
Fast primal-dual projected linear iterations for distributed consensus in constrained convex optimization
In this paper we study the constrained consensus problem, i.e. the problem of reaching a common point from the estimates generated by multiple agents that are constrained to lie in...
Ion Necoara, Ioan Dumitrache, Johan A. K. Suykens
CORR
2010
Springer
119views Education» more  CORR 2010»
14 years 9 months ago
Effective complexity of stationary process realizations
The concept of effective complexity of an object as the minimal description length of its regularities has been initiated by Gell-Mann and Lloyd. The regularities are modeled by m...
Nihat Ay, Markus Müller, Arleta Szkola
120
Voted
JCST
2010
189views more  JCST 2010»
14 years 8 months ago
Formally Analyzing Expected Time Complexity of Algorithms Using Theorem Proving
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
Osman Hasan, Sofiène Tahar