6365 search results - page 824 / 1273 » Fast Local Computation Algorithms |
240
click to vote
WDAG
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. Since in general it is NP-hard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation...
222
click to vote
IPPS
1998
IEEE
15 years 11 months ago
1998
IEEE
A number of solutions have been proposed for the problem of mutual exclusion in distributed systems. Some of these approaches have since been extended to a prioritized environment...
192
click to vote
VIS
2004
IEEE
16 years 8 months ago
2004
IEEE
We present a fast, topology-preserving approach for isosurface simplification. The underlying concept behind our approach is to preserve the disconnected surface components in cel...
197
click to vote
DAC
2000
ACM
16 years 8 months ago
2000
ACM
In this paper, we study the incremental t echnology mapping problem for lookup-table (LUT) based Field Programmable Gate Arrays (FPGAs) under incremental changes. Given a gate-lev...
165
click to vote
ICML
2004
IEEE
16 years 8 months ago
2004
IEEE
A new class of nonparametric algorithms for high-dimensional binary classification is proposed using cascades of low dimensional polynomial structures. Construction of polynomial ...