Sciweavers

458 search results - page 37 / 92
» Perfect Skolem sets
Sort
View
DMTCS
2010
157views Mathematics» more  DMTCS 2010»
14 years 9 months ago
Edge-Removal and Non-Crossing Configurations in Geometric Graphs
A geometric graph is a graph G = (V, E) drawn in the plane, such that V is a point set in general position and E is a set of straight-line segments whose endpoints belong to V . W...
Oswin Aichholzer, Sergio Cabello, Ruy Fabila Monro...
CDC
2010
IEEE
203views Control Systems» more  CDC 2010»
14 years 6 months 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...
FLAIRS
2008
15 years 2 months ago
Learning in the Lexical-Grammatical Interface
Children are facile at both discovering word boundaries and using those words to build higher-level structures in tandem. Current research treats lexical acquisition and grammar i...
Tom Armstrong, Tim Oates
TIT
2008
105views more  TIT 2008»
14 years 10 months ago
State Discrimination With Post-Measurement Information
We introduce a new state discrimination problem in which we are given additional information about the state after the measurement, or more generally, after a quantum memory bound ...
Manuel A. Ballester, Stephanie Wehner, Andreas Win...
IWOCA
2009
Springer
104views Algorithms» more  IWOCA 2009»
15 years 6 months ago
An O(n)-Time Algorithm for the Paired-Domination Problem on Permutation Graphs
A vertex subset D of a graph G is a dominating set if every vertex of G is either in D or is adjacent to a vertex in D. The paired-domination problem on G asks for a minimum-cardi...
Evaggelos Lappas, Stavros D. Nikolopoulos, Leonida...