Sciweavers

305 search results - page 26 / 61
» From Sets to Bits in Coq
Sort
View
SENSYS
2006
ACM
16 years 22 days ago
Data analysis tools for sensor-based science
Science is increasingly driven by data collected automatically from arrays of inexpensive sensors. The collected data volumes require a different approach from the scientists'...
Stuart Ozer, Jim Gray, Alexander S. Szalay, Andrea...
ICCAD
2001
IEEE
128views Hardware» more  ICCAD 2001»
16 years 3 months ago
An Assembly-Level Execution-Time Model for Pipelined Architectures
The aim of this work is to provide an elegant and accurate static execution timing model for 32-bit microprocessor instruction sets, covering also inter–instruction effects. Suc...
Giovanni Beltrame, Carlo Brandolese, William Forna...
SPIRE
2000
Springer
15 years 10 months ago
Fast Multipattern Search Algorithms for Intrusion Detection
We present new search algorithms to detect the occurrences of any pattern from a given pattern set in a text, allowing in the occurrences a limited number of spurious text charact...
Josué Kuri, Gonzalo Navarro
CORR
2008
Springer
112views Education» more  CORR 2008»
15 years 6 months ago
Compact Labelings For Efficient First-Order Model-Checking
We consider graph properties that can be checked from labels, i.e., bit sequences, of logarithmic length attached to vertices. We prove that there exists such a labeling for check...
Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha...
CORR
2008
Springer
111views Education» more  CORR 2008»
15 years 5 months ago
Concave Programming Upper Bounds on the Capacity of 2-D Constraints
The capacity of 1-D constraints is given by the entropy of a corresponding stationary maxentropic Markov chain. Namely, the entropy is maximized over a set of probability distribut...
Ido Tal, Ron M. Roth