Sciweavers

5022 search results - page 578 / 1005
» Data structures and problem solving using Java
Sort
View
ARSCOM
2007
65views more  ARSCOM 2007»
15 years 4 months ago
Odd and Even Dominating Sets with Open Neighborhoods
A subset D of the vertex set V of a graph is called an open oddd dominating set if each vertex in V is adjacent to an odd number of vertices in D (adjacency is irreflexive). In t...
John L. Goldwasser, William Klostermeyer
91
Voted
DM
2006
63views more  DM 2006»
15 years 4 months ago
Efficient crossover designs for comparing test treatments with a control treatment
Within a large family of crossover designs this paper characterizes the mathematical structures of A-optimal and A-efficient crossover designs for the purpose of statistical compa...
A. Sadam Hedayat, Min Yang
ICCAD
2010
IEEE
140views Hardware» more  ICCAD 2010»
15 years 2 months ago
Reduction of interpolants for logic synthesis
Craig Interpolation is a state-of-the-art technique for logic synthesis and verification, based on Boolean Satisfiability (SAT). Leveraging the efficacy of SAT algorithms, Craig In...
John D. Backes, Marc D. Riedel
CDC
2010
IEEE
129views Control Systems» more  CDC 2010»
14 years 11 months ago
On parameterized Lyapunov and control Lyapunov functions for discrete-time systems
This paper deals with the existence and synthesis of parameterized-(control) Lyapunov functions (p-(C)LFs) for discrete-time nonlinear systems that are possibly subject to constrai...
Mircea Lazar, Rob H. Gielen
ICASSP
2011
IEEE
14 years 7 months ago
Time-to-Onset latency in fMRI: Fast detection of delayed activation
A standard fMRI experiment is structured around the assumption that onset of relevant neural activity occurs almost immediately after external stimulus. Introducing deliberate len...
Victor Solo, Ben Cassidy, Christopher J. Long, Car...