4913 search results - page 166 / 983 » Results and Perspectives of the G |
154
click to vote
ICDM
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract--Data clustering is a highly used knowledge extraction technique and is applied in more and more application domains. Over the last years, a lot of algorithms have been pr...
157
click to vote
SAC
2009
ACM
16 years 1 months ago
2009
ACM
This paper proposes 2G, a flexible and energy-efficient data collection protocol for sensor networks for increasing network lifetime. To this end, it integrates self-organizing d...
177
click to vote
GD
2005
Springer
16 years 1 days ago
2005
Springer
Abstract. In this paper we present an algorithm for drawing an undirected graph G which takes advantage of the structure of the modular decomposition tree of G. Specifically, our ...
171
click to vote
FCT
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. In the paper we present a purely logical approach to estimating computational complexity of potentially intractable problems. The approach is based on descriptive complex...
137
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Consider a routing problem instance consisting of a demand graph H = (V, E(H)) and a supply graph G = (V, E(G)). If the pair obeys the cut condition, then the flow-cut gap for thi...