Sciweavers

1538 search results - page 6 / 308
» Relative Randomness and Cardinality
Sort
View
JCP
2006
91views more  JCP 2006»
13 years 9 months ago
The Matching Predicate and a Filtering Scheme Based on Matroids
Finding a maximum cardinality matching in a graph is a problem appearing in numerous settings. The problem asks for a set of edges of maximum cardinality, such that no two edges of...
Dimitris Magos, Ioannis Mourtos, Leonidas S. Pitso...
JSYML
2006
86views more  JSYML 2006»
13 years 9 months ago
Degrees of monotone complexity
Levin and Schnorr (independently) introduced the monotone complexity, Km(), of a binary string . We use monotone complexity to define the relative complexity (or relative randomnes...
William C. Calhoun
IOR
2008
91views more  IOR 2008»
13 years 9 months ago
A Randomized Quasi-Monte Carlo Simulation Method for Markov Chains
We introduce and study a randomized quasi-Monte Carlo method for estimating the state distribution at each step of a Markov chain. The number of steps in the chain can be random an...
Pierre L'Ecuyer, Christian Lécot, Bruno Tuf...
EDBT
2004
ACM
142views Database» more  EDBT 2004»
14 years 3 months ago
Computing and Handling Cardinal Direction Information
Qualitative spatial reasoning forms an important part of the commonsense reasoning required for building intelligent Geographical Information Systems (GIS). Previous research has c...
Spiros Skiadopoulos, Christos Giannoukos, Panos Va...
FOIS
2006
13 years 11 months ago
A theory of granular parthood based on qualitative cardinality and size measures
We present a theory of granular parthood based on qualitative cardinality and size measures. Using standard mereological relations and qualitative, contextdependent relations such ...
Thomas Bittner, Maureen Donnelly