3708 search results - page 246 / 742 » Approximating Betweenness Centrality |
178
click to vote
AICOM
2006
15 years 6 months ago
2006
This paper introduces a compact representation which helps to avoid the exponential blow-up in space of the Least Common Subsumer (lcs) of two ALEconcept descriptions. Based on th...
150
click to vote
TIT
2008
15 years 6 months ago
2008
We consider the design of systems for sequential decentralized detection, a problem that entails several interdependent choices: the choice of a stopping rule (specifying the samp...
147
click to vote
JDA
2007
15 years 6 months ago
2007
The problem of approximate parameterized string searching consists of finding, for a given text t = t1t2 ...tn and pattern p = p1p2 ...pm over respective alphabets Σt and Σp, t...
154
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
Sorting by reversals is an important problem in inferring the evolutionary relationship between two genomes. The problem of sorting unsigned permutation has been proven to be NP-ha...
172
click to vote
GEOINFORMATICA
2002
15 years 6 months ago
2002
This paper deals with the representation and the processing of information about spatial objects with indeterminate location like valleys or dunes (objects subject to vagueness). ...