1449 search results - page 187 / 290 » Finiteness results for sigmoidal |
154
click to vote
JSYML
2010
15 years 1 months ago
2010
A set A of vertices of a graph G is called d-scattered in G if no two d-neighborhoods of (distinct) vertices of A intersect. In other words, A is d-scattered if no two distinct ver...
160
click to vote
STOC
2006
ACM
16 years 6 months ago
2006
ACM
A common thread in all the recent results concerning the testing of dense graphs is the use of Szemer?edi's regularity lemma. In this paper we show that in some sense this is...
138
click to vote
ICSM
2009
IEEE
16 years 1 months ago
2009
IEEE
Dependence analysis underpins many activities in software maintenance such as comprehension and impact analysis. As a result, dependence has been studied widely for programming la...
164
click to vote
CIE
2008
Springer
15 years 8 months ago
2008
Springer
Consider the problem of calculating the fractal dimension of a set X consisting of all infinite sequences S over a finite alphabet that satisfy some given condition P on the asympt...
184
click to vote
SODA
2008
ACM
15 years 7 months ago
2008
ACM
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P, our goal is to find a set C of size k such that the s...