Sciweavers

3894 search results - page 548 / 779
» Approximation Algorithms for Biclustering Problems
Sort
View
ALGORITHMICA
2011
14 years 11 months ago
Crossing Numbers of Graphs with Rotation Systems
We show that computing the crossing number and the odd crossing number of a graph with a given rotation system is NP-complete. As a consequence we can show that many of the well-k...
Michael J. Pelsmajer, Marcus Schaefer, Daniel Stef...
CDC
2010
IEEE
210views Control Systems» more  CDC 2010»
14 years 11 months ago
Advances in moving horizon estimation for nonlinear systems
In the past decade, moving horizon estimation (MHE) has emerged as a powerful technique for estimating the state of a dynamical system in the presence of nonlinearities and disturb...
Angelo Alessandri, Marco Baglietto, Giorgio Battis...
TSP
2011
165views more  TSP 2011»
14 years 11 months ago
Quaternion ICA From Second-Order Statistics
—This paper addresses the independent component analysis (ICA) of quaternion random vectors. In particular, we focus on the Gaussian case and therefore only consider the quaterni...
Javier Vía, Daniel P. Palomar, Luis Vielva,...
141
Voted
ICC
2011
IEEE
205views Communications» more  ICC 2011»
14 years 3 months ago
Decentralized Cross-Tier Interference Mitigation in Cognitive Femtocell Networks
—In this paper, recent results in game theory and stochastic approximation are brought together to mitigate the problem of femto-to-macrocell cross-tier interference. The main re...
Mehdi Bennis, Samir Medina Perlaza
JMLR
2012
13 years 6 months ago
Conditional Likelihood Maximisation: A Unifying Framework for Information Theoretic Feature Selection
We present a unifying framework for information theoretic feature selection, bringing almost two decades of research on heuristic filter criteria under a single theoretical inter...
Gavin Brown, Adam Pocock, Ming-Jie Zhao, Mikel Luj...