4865 search results - page 272 / 973 » The Complexity of Graph Connectivity |
194
click to vote
PAMI
2006
15 years 6 months ago
2006
We provide evidence that non-linear dimensionality reduction, clustering and data set parameterization can be solved within one and the same framework. The main idea is to define ...
157
click to vote
NETWORKS
2002
15 years 6 months ago
2002
The conditional diameter D of a digraph G measures how far apart a pair of vertex sets V1 and V2 can be in such a way that the minimum out-degree and the minimum in-degree of the ...
222
click to vote
WAW
2010
Springer
15 years 4 months ago
2010
Springer
Large scale real-world network data such as social and information networks are ubiquitous. The study of such social and information networks seeks to find patterns and explain th...
190
click to vote
WEBI
2010
Springer
15 years 4 months ago
2010
Springer
Mobile is becoming a ubiquitous platform for context-aware intelligent computing. One fundamental but usually ignored issue is how to efficiently manage (e.g., index and query) the...
164
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical prop...