Sciweavers

440 search results - page 87 / 88
» On partial randomness
Sort
View
MVA
2011
336views Computer Vision» more  MVA 2011»
13 years 1 months ago
In-vehicle camera traffic sign detection and recognition
: In this paper we discuss theoretical foundations and a practical realization of a real-time traffic sign detection, tracking and recognition system operating on board of a vehicl...
Andrzej Ruta, Fatih Porikli, Shintaro Watanabe, Yo...
SIAMMAX
2010
164views more  SIAMMAX 2010»
13 years 26 days ago
Uniqueness of Low-Rank Matrix Completion by Rigidity Theory
The problem of completing a low-rank matrix from a subset of its entries is often encountered in the analysis of incomplete data sets exhibiting an underlying factor model with app...
Amit Singer, Mihai Cucuringu
TON
2010
136views more  TON 2010»
13 years 25 days ago
Distributed Opportunistic Scheduling With Two-Level Probing
Distributed opportunistic scheduling (DOS) is studied for wireless ad-hoc networks in which many links contend for the channel using random access before data transmissions. Simpl...
P. S. Chandrashekhar Thejaswi, Junshan Zhang, Man-...
CDC
2010
IEEE
203views Control Systems» more  CDC 2010»
13 years 19 days ago
Cyber security analysis of state estimators in electric power systems
In this paper, we analyze the cyber security of state estimators in Supervisory Control and Data Acquisition (SCADA) systems operating in power grids. Safe and reliable operation o...
André Teixeira, Saurabh Amin, Henrik Sandbe...
ICALP
2011
Springer
12 years 9 months ago
Vertex Cover in Graphs with Locally Few Colors
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
Fabian Kuhn, Monaldo Mastrolilli