1951 search results - page 246 / 391 » An algorithm for improving graph partitions |
151
click to vote
CIKM
2010
Springer
15 years 3 months ago
2010
Springer
The cost of reachability query computation using traditional algorithms such as depth first search or transitive closure has been found to be prohibitive and unacceptable in mass...
169
click to vote
IWCIA
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. In this paper, we address the problem of computing a canonical representation of an n-dimensional combinatorial map. To do so, we define two combinatorial map signatures...
157
click to vote
IROS
2007
IEEE
15 years 11 months ago
2007
IEEE
— We present a Graph-based method for low-level segmentation of unfiltered 3D data. The core of this approach is based on the construction of a local neighborhood structure and ...
155
click to vote
RECOMB
2005
Springer
16 years 5 months ago
2005
Springer
Abstract. We introduce an extended computational framework for studying biological systems. Our approach combines formalization of existing qualitative models that are in wide but ...
148
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
This paper considers a relay-assisted bidirectional cellular network where the base station (BS) communicates with each mobile station (MS) using orthogonal frequencydivision multi...