674 search results - page 44 / 135 » The computational complexity of the parallel knock-out probl... |
183
click to vote
JPDC
2007
15 years 1 months ago
2007
High-dimensional problems arising from robot motion planning, biology, data mining, and geographic information systems often require the computation of k nearest neighbor (knn) gr...
148
click to vote
CPHYSICS
2010
15 years 1 months ago
2010
We investigate fully parallel Newton-Krylov-Schwarz (NKS) algorithms for solving the large sparse nonlinear systems of equations arising from the finite element discretization of ...
108
click to vote
IPL
2007
15 years 1 months ago
2007
We show that the problem of reaching a state set with probability 1 in probabilisticnondeterministic systems operating in parallel is EXPTIME-complete. We then show that this prob...
117
click to vote
PPOPP
2010
ACM
15 years 7 months ago
2010
ACM
In processors with several levels of hardware resource sharing, like CMPs in which each core is an SMT, the scheduling process becomes more complex than in processors with a singl...
147
click to vote
ICPP
2000
IEEE
15 years 5 months ago
2000
IEEE
Clustering is a data mining problem which finds dense regions in a sparse multi-dimensional data set. The attribute values and ranges of these regions characterize the clusters. ...