Sciweavers

7106 search results - page 182 / 1422
» Restricted Complexity, General Complexity
Sort
View
128
Voted
TKDE
2008
121views more  TKDE 2008»
15 years 3 months ago
On Modularity Clustering
Modularity is a recently introduced quality measure for graph clusterings. It has immediately received considerable attention in several disciplines, and in particular in the compl...
Ulrik Brandes, Daniel Delling, Marco Gaertler, Rob...
98
Voted
STOC
2005
ACM
163views Algorithms» more  STOC 2005»
16 years 3 months ago
Undirected ST-connectivity in log-space
We present a deterministic, log-space algorithm that solves st-connectivity in undirected graphs. The previous bound on the space complexity of undirected st-connectivity was log4...
Omer Reingold
137
Voted
VMCAI
2007
Springer
15 years 9 months ago
On Flat Programs with Lists
Abstract. In this paper we analyze the complexity of checking safety and termination properties, for a very simple, yet non-trivial, class of programs with singly-linked list data ...
Marius Bozga, Radu Iosif
122
Voted
WG
2007
Springer
15 years 9 months ago
On Finding Graph Clusterings with Maximum Modularity
Modularity is a recently introduced quality measure for graph clusterings. It has immediately received considerable attention in several disciplines, and in particular in the compl...
Ulrik Brandes, Daniel Delling, Marco Gaertler, Rob...
135
Voted
ICDM
2005
IEEE
185views Data Mining» more  ICDM 2005»
15 years 9 months ago
Semi-Supervised Mixture of Kernels via LPBoost Methods
We propose an algorithm to construct classification models with a mixture of kernels from labeled and unlabeled data. The derived classifier is a mixture of models, each based o...
Jinbo Bi, Glenn Fung, Murat Dundar, R. Bharat Rao