6437 search results - page 310 / 1288 » Parallel Algorithms for Arrangements |
140
Voted
KDD
2009
ACM
15 years 8 months ago
2009
ACM
Graphs or networks can be used to model complex systems. Detecting community structures from large network data is a classic and challenging task. In this paper, we propose a nove...
155
Voted
DAC
2010
ACM
15 years 4 months ago
2010
ACM
Leveraging the power of nowadays graphics processing units for robust power grid simulation remains a challenging task. Existing preconditioned iterative methods that require inco...
107
Voted
APL
1993
ACM
15 years 8 months ago
1993
ACM
: The problem of a finding of ranging of the objects nearest to the cyclic relation set by the expert between objects is considered. Formalization of the problem arising at it is r...
153
click to vote
CATA
2004
15 years 5 months ago
2004
Thinning operation is a fundamental operation in image processing. It is a typical preprocessing stage for pattern recognition and data compression. In this report we proposed an ...
126
click to vote
IPPS
2002
IEEE
15 years 8 months ago
2002
IEEE
The problem of merging two intransitive sorted sequences (that is, to generate a sorted total order without the transitive property) is considered. A cost-optimal parallel merging...