Sciweavers

2569 search results - page 10 / 514
» Approximate Objects and Approximate Theories
Sort
View
ENTCS
2006
159views more  ENTCS 2006»
14 years 11 months ago
Approximations of Modal Logic K
Inspired by the recent work on approximating classical logic, we present a procedure that approximates the modal logic K by determining a maximum limit of introspection. This proc...
Guilherme de Souza Rabello, Marcelo Finger
PODC
2006
ACM
15 years 5 months ago
Object location using path separators
We study a novel separator property called k-path separable. Roughly speaking, a k-path separable graph can be recursively separated into smaller components by sequentially removi...
Ittai Abraham, Cyril Gavoille
CORR
2008
Springer
80views Education» more  CORR 2008»
14 years 11 months ago
A Dual Polynomial for OR
We reprove that the approximate degree of the OR function on n bits is ( n). We consider a linear program which is feasible if and only if there is an approximate polynomial for ...
Robert Spalek
FUIN
2006
160views more  FUIN 2006»
14 years 11 months ago
Behavioral Pattern Identification Through Rough Set Modeling
This paper introduces an approach to behavioral pattern identification as a part of a study of temporal patterns in complex dynamical systems. Rough set theory introduced by Zdzisl...
Jan G. Bazan
ICASSP
2011
IEEE
14 years 3 months ago
Compressive sensing meets game theory
We introduce the Multiplicative Update Selector and Estimator (MUSE) algorithm for sparse approximation in underdetermined linear regression problems. Given f = Φα∗ + µ, the ...
Sina Jafarpour, Robert E. Schapire, Volkan Cevher