Sciweavers

4066 search results - page 108 / 814
» Almost Complete Sets
Sort
View
TIP
2002
97views more  TIP 2002»
15 years 6 months ago
Affine invariants of convex polygons
In this correspondence, we prove that the affine invariants proposed recently by Yang and Cohen [1] are algebraically dependent. We show how to select an independent and complete s...
Jan Flusser
SIAMADS
2010
95views more  SIAMADS 2010»
15 years 1 months ago
Observing Infinite-dimensional Dynamical Systems
We study the extent to which properties of infinite-dimensional dynamical systems can be accurately detected by examining observations of such systems. Let H be a separable Hilbert...
Jessica Lin, William Ott
TAP
2010
Springer
102views Hardware» more  TAP 2010»
15 years 11 months ago
Generating High-Quality Tests for Boolean Circuits by Treating Tests as Proof Encoding
Abstract. We consider the problem of test generation for Boolean combinational circuits. We use a novel approach based on the idea of treating tests as a proof encoding rather than...
Eugene Goldberg, Panagiotis Manolios
CORR
2010
Springer
48views Education» more  CORR 2010»
15 years 6 months ago
Min-Rank Conjecture for Log-Depth Circuits
A completion of an m-by-n matrix A with entries in {0,1,} is obtained by setting all -entries to
Stasys Jukna, Georg Schnitger
FM
2005
Springer
114views Formal Methods» more  FM 2005»
15 years 12 months ago
Systematic Implementation of Real-Time Models
Recently we have proposed the ”almost ASAP” semantics as an alternative semantics for timed automata. This semantics is useful when modeling real-time controllers : control str...
Martin De Wulf, Laurent Doyen, Jean-Françoi...