Sciweavers

6251 search results - page 80 / 1251
» Randomness, Computability, and Density
Sort
View
COMBINATORICA
2008
130views more  COMBINATORICA 2008»
13 years 10 months ago
Two-point concentration in random geometric graphs
A random geometric graph Gn is constructed by taking vertices X1, . . . , Xn Rd at random (i.i.d. according to some probability distribution with a bounded density function) and...
Tobias Müller
JSAT
2006
69views more  JSAT 2006»
13 years 10 months ago
The SAT 2005 Solver Competition on Random Instances
An analysis of the SAT 2005 sub-competition on random instances is given. This year this (sub-)competition set-up was geared to establish a basic setting, focusing on the instance...
Oliver Kullmann
GIS
2008
ACM
14 years 11 months ago
Density based co-location pattern discovery
Co-location pattern discovery is to find classes of spatial objects that are frequently located together. For example, if two categories of businesses often locate together, they ...
Xiangye Xiao, Xing Xie, Qiong Luo, Wei-Ying Ma
MSR
2006
ACM
14 years 3 months ago
Predicting defect densities in source code files with decision tree learners
With the advent of open source software repositories the data available for defect prediction in source files increased tremendously. Although traditional statistics turned out t...
Patrick Knab, Martin Pinzger, Abraham Bernstein
SAT
2004
Springer
117views Hardware» more  SAT 2004»
14 years 3 months ago
A Random Constraint Satisfaction Problem That Seems Hard for DPLL
Abstract. This paper discusses an NP-complete constraint satisfaction problem which appears to share many of the threshold characteristics of SAT but is similar to XOR-SAT and so i...
Harold S. Connamacher