Sciweavers

197 search results - page 4 / 40
» Strongly meager and strong measure zero sets
Sort
View
SODA
2004
ACM
111views Algorithms» more  SODA 2004»
15 years 1 months ago
Fast mixing for independent sets, colorings and other models on trees
We study the mixing time of the Glauber dynamics for general spin systems on bounded-degree trees, including the Ising model, the hard-core model (independent sets) and the antife...
Fabio Martinelli, Alistair Sinclair, Dror Weitz
NIPS
2008
15 years 1 months ago
Measures of Clustering Quality: A Working Set of Axioms for Clustering
Aiming towards the development of a general clustering theory, we discuss abstract axiomatization for clustering. In this respect, we follow up on the work of Kleinberg, ([1]) tha...
Shai Ben-David, Margareta Ackerman
ECCC
2006
90views more  ECCC 2006»
14 years 11 months ago
Comparing Reductions to NP-Complete Sets
Under the assumption that NP does not have p-measure 0, we investigate reductions to NP-complete sets and prove the following: (1) Adaptive reductions are more powerful than nonad...
John M. Hitchcock, Aduri Pavan
COCO
1994
Springer
100views Algorithms» more  COCO 1994»
15 years 3 months ago
Relative to a Random Oracle, NP is Not Small
Resource-bounded measure as originated by Lutz is an extension of classical measure theory which provides a probabilistic means of describing the relative sizes of complexity clas...
Steven M. Kautz, Peter Bro Miltersen
GECCO
2004
Springer
101views Optimization» more  GECCO 2004»
15 years 5 months ago
New Epistasis Measures for Detecting Independently Optimizable Partitions of Variables
An optimization problem is often represented with a set of variables, and the interaction between the variables is referred to as epistasis. In this paper, we propose two new measu...
Dong-il Seo, Sung-Soon Choi, Byung Ro Moon