Sciweavers

457 search results - page 33 / 92
» Boolean algebras arising from information systems
Sort
View
EMSOFT
2004
Springer
15 years 5 months ago
Conservative approximations for heterogeneous design
Embedded systems are electronic devices that function in the context of a real environment, by sensing and reacting to a set of stimuli. Because of their close interaction with th...
Roberto Passerone, Jerry R. Burch, Alberto L. Sang...
AUTOMATICA
2007
75views more  AUTOMATICA 2007»
14 years 12 months ago
Systematic ultimate bound computation for sampled-data systems with quantization
We present a novel systematic method to obtain componentwise ultimate bounds in perturbed sampled-data systems, especially when the perturbations arise due to quantization. The pr...
Hernan Haimovich, Ernesto Kofman, María M. ...
SODA
2010
ACM
185views Algorithms» more  SODA 2010»
14 years 10 months ago
Solving MAX-r-SAT Above a Tight Lower Bound
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...
Noga Alon, Gregory Gutin, Eun Jung Kim, Stefan Sze...
SIGMOD
2008
ACM
203views Database» more  SIGMOD 2008»
16 years 11 hour ago
Querying continuous functions in a database system
Many scientific, financial, data mining and sensor network applications need to work with continuous, rather than discrete data e.g., temperature as a function of location, or sto...
Arvind Thiagarajan, Samuel Madden
ALMOB
2006
155views more  ALMOB 2006»
14 years 12 months ago
Refining motifs by improving information content scores using neighborhood profile search
The main goal of the motif finding problem is to detect novel, over-represented unknown signals in a set of sequences (e.g. transcription factor binding sites in a genome). The mo...
Chandan K. Reddy, Yao-Chung Weng, Hsiao-Dong Chian...