Sciweavers

5592 search results - page 265 / 1119
» On Random Betweenness Constraints
Sort
View
SODA
2010
ACM
149views Algorithms» more  SODA 2010»
16 years 3 months ago
Data-Specific Analysis of String Sorting
We consider the complexity of sorting strings in the model that counts comparisons between symbols and not just comparisons between strings. We show that for any set of strings S ...
Raimund Seidel
WSC
1997
15 years 7 months ago
Descriptive Sampling: An Improvement over Latin Hypercube Sampling
Descriptive Sampling (DS), a Monte Carlo sampling technique based on a deterministic selection of the input values and their random permutation, represents a deep conceptual chang...
Eduardo Saliby
CONNECTION
2006
101views more  CONNECTION 2006»
15 years 6 months ago
High capacity, small world associative memory models
Models of associative memory usually have full connectivity or if diluted, random symmetric connectivity. In contrast, biological neural systems have predominantly local, non-symm...
Neil Davey, Lee Calcraft, Rod Adams
CAISE
2004
Springer
15 years 12 months ago
Towards a Semi-Automated Approach to Intermodel Transformation
This paper introduces an extension to the hypergraph data model used in the AutoMed data intergration approach that allows constraints common in static data modelling languages to ...
Michael Boyd, Peter McBrien
KR
2004
Springer
15 years 12 months ago
Distance Semantics for Relevance-Sensitive Belief Revision
Possible-world semantics are provided for Parikh’s relevance-sensitive model for belief revision. Having Grove’s system-of-spheres construction as a base, we consider addition...
Pavlos Peppas, Samir Chopra, Norman Y. Foo