Sciweavers

20294 search results - page 116 / 4059
» Algorithmic Information Theory
Sort
View
ICC
2011
IEEE
219views Communications» more  ICC 2011»
14 years 6 months ago
Deterministic Equivalents for the Performance Analysis of Isometric Random Precoded Systems
—We consider a general wireless channel model for different types of code-division multiple access (CDMA) and space-division multiple-access (SDMA) systems with isometric random ...
Jakob Hoydis, Romain Couillet, Mérouane Deb...
169
Voted
ICML
1996
IEEE
16 years 7 months ago
Toward Optimal Feature Selection
In this paper, we examine a method for feature subset selection based on Information Theory. Initially, a framework for de ning the theoretically optimal, but computationally intr...
Daphne Koller, Mehran Sahami
CDC
2008
IEEE
129views Control Systems» more  CDC 2008»
16 years 1 months ago
Distributed motion constraints for algebraic connectivity of robotic networks
— This paper studies connectivity maintenance of robotic networks that communicate at discrete times and move in continuous space. We propose a distributed algorithm that allows ...
Michael Schuresko, Jorge Cortés
COMPGEOM
2011
ACM
14 years 10 months ago
Ant-sweep: a decentral strategy for cooperative cleaning in expanding domains
Several recent works considered cooperative cleaning in static and dynamic environments, which incorporates a swarm of simple robots cleaning an expanding region of contaminated c...
Thilo Beckmann, Rolf Klein, David Kriesel, Elmar L...
SIGIR
2008
ACM
15 years 6 months ago
Parsimonious relevance models
We describe a method for applying parsimonious language models to re-estimate the term probabilities assigned by relevance models. We apply our method to six topic sets from test ...
Edgar Meij, Wouter Weerkamp, Krisztian Balog, Maar...