Sciweavers

831 search results - page 127 / 167
» Coalgebraic Correspondence Theory
Sort
View
CORR
2010
Springer
136views Education» more  CORR 2010»
14 years 9 months ago
Schaefer's theorem for graphs
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
Manuel Bodirsky, Michael Pinsker
CDC
2010
IEEE
226views Control Systems» more  CDC 2010»
14 years 6 months ago
Fast primal-dual projected linear iterations for distributed consensus in constrained convex optimization
In this paper we study the constrained consensus problem, i.e. the problem of reaching a common point from the estimates generated by multiple agents that are constrained to lie in...
Ion Necoara, Ioan Dumitrache, Johan A. K. Suykens
CORR
2011
Springer
153views Education» more  CORR 2011»
14 years 6 months ago
Proof-Theoretic Soundness and Completeness
We give a calculus for reasoning about the first-order fragment of classical logic that is adequate for giving the truth conditions of intuitionistic Kripke frames, and outline a...
Robert Rothenberg
TSP
2011
151views more  TSP 2011»
14 years 6 months ago
Stochastic Models for Sparse and Piecewise-Smooth Signals
Abstract—We introduce an extended family of continuous-domain stochastic models for sparse, piecewise-smooth signals. These are specified as solutions of stochastic differential...
Michael Unser, Pouya Dehghani Tafti
JDCTA
2010
172views more  JDCTA 2010»
14 years 6 months ago
A Method of Bearing Fault Feature Extraction Based on Improved Wavelet Packet and Hilbert Analysis
In order to supply a gap of current resonance vibration and STFT demodulation method applied to rolling bearing fault feature extraction of city rail vehicle, a fault diagnosis me...
Jian-wei Yang, De-chen Yao, Guo-qiang Cai, Hai-bo ...