Sciweavers

1948 search results - page 265 / 390
» Formalizing Mirror Theory
Sort
View
TSMC
2011
210views more  TSMC 2011»
15 years 16 days ago
Fault Diagnosis in Discrete-Event Systems: Incomplete Models and Learning
— Most state-based approaches to fault diagnosis of discrete-event systems require a complete and accurate model of the system to be diagnosed. In this paper, we address the prob...
Raymond H. Kwong, David L. Yonge-Mallo
163
Voted
TCS
2010
15 years 9 days ago
Factorization forests for infinite words and applications to countable scattered linear orderings
The theorem of factorization forests of Imre Simon shows the existence of nested factorizations -- `a la Ramsey -- for finite words. This theorem has important applications in sem...
Thomas Colcombet
CORR
2011
Springer
144views Education» more  CORR 2011»
14 years 9 months ago
Rank Aggregation via Nuclear Norm Minimization
The process of rank aggregation is intimately intertwined with the structure of skew-symmetric matrices. We apply recent advances in the theory and algorithms of matrix completion...
David F. Gleich, Lek-Heng Lim
258
Voted
ICOM
2011
14 years 9 months ago
A Context-Aware Proactive Controller for Smart Environments
In this paper we describe an implicit user interface for smart environment control: We make our system guess how to assist the user(s) proactively. Our controller is based on two ...
Frank Krüger, Gernot Ruscher, Sebastian Bader...
SIAMCOMP
2011
14 years 8 months ago
Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut
We consider the Minimum Linear Arrangement problem and the (Uniform) Sparsest Cut problem. So far, these two notorious NP-hard graph problems have resisted all attempts to prove in...
Christoph Ambühl, Monaldo Mastrolilli, Ola Sv...