Sciweavers

894 search results - page 8 / 179
» Universal Relations and
Sort
View
DAGSTUHL
2007
13 years 8 months ago
Parallel universes to improve the diagnosis of cardiac arrhythmias
arrhythmias (extended abstract) Elisa Fromont, Ren´e Quiniou, Marie-Odile Cordier We are interested in using parallel universes to learn interpretable models that can be subseque...
Élisa Fromont, Rene Quiniou, Marie-Odile Co...
ALENEX
2010
156views Algorithms» more  ALENEX 2010»
13 years 8 months ago
Tabulation Based 5-Universal Hashing and Linear Probing
Previously [SODA'04] we devised the fastest known algorithm for 4-universal hashing. The hashing was based on small pre-computed 4-universal tables. This led to a five-fold i...
Mikkel Thorup, Yin Zhang
APAL
2006
45views more  APAL 2006»
13 years 7 months ago
On properties of theories which preclude the existence of universal models
We introduce the oak property of first order theories, which is a syntactical condition that we show to be sufficient for a theory not to have universal models in cardinality whe...
Mirna Dzamonja, Saharon Shelah
JSYML
2000
78views more  JSYML 2000»
13 years 6 months ago
On Quantification with A Finite Universe
We consider a finite universe U (more exactly - a family U of them), second order quantifiers QK , where for each U this means quantifying over a family of n(K)-place relations clo...
Saharon Shelah
LICS
2010
IEEE
13 years 5 months ago
On the Scope of the Universal-Algebraic Approach to Constraint Satisfaction
The universal-algebraic approach has proved a powerful tool in the study of the computational complexity of constraint satisfaction problems (CSPs). This approach has previously b...
Manuel Bodirsky, Martin Hils, Barnaby Martin