Sciweavers

76 search results - page 3 / 16
» Some Small Cancellation Properties of Random Groups
Sort
View
LATA
2010
Springer
14 years 6 months ago
Untestable Properties Expressible with Four First-Order Quantifiers
Abstract. In property testing, the goal is to distinguish between structures that have some desired property and those that are far from having the property, after examining only a...
Charles Jordan and Thomas Zeugmann
AAAI
2000
13 years 10 months ago
Redundancy in Random SAT Formulas
The random k-SAT model is extensively used to compare satisfiability algorithms or to find the best settings for the parameters of some algorithm. Conclusions are derived from the...
Yacine Boufkhad, Olivier Roussel
CMOT
2004
141views more  CMOT 2004»
13 years 8 months ago
Small Worlds Among Interlocking Directors: Network Structure and Distance in Bipartite Graphs
We describe a methodology to examine bipartite relational data structures as exemplified in networks of corporate interlocking. These structures can be represented as bipartite gr...
Garry Robins, Malcolm Alexander
STOC
2000
ACM
112views Algorithms» more  STOC 2000»
14 years 27 days ago
A random graph model for massive graphs
We propose a random graph model which is a special case of sparse random graphs with given degree sequences. This model involves only a small number of parameters, called logsize ...
William Aiello, Fan R. K. Chung, Linyuan Lu
BMCBI
2005
136views more  BMCBI 2005»
13 years 8 months ago
Automatic detection of false annotations via binary property clustering
Background: Computational protein annotation methods occasionally introduce errors. Falsepositive (FP) errors are annotations that are mistakenly associated with a protein. Such f...
Noam Kaplan, Michal Linial