3598 search results - page 219 / 720 » New efficient algorithms for computing effective capacitance |
162
click to vote
ENTCS
2008
15 years 6 months ago
2008
The well-known notion of critical pairs already allows a static conflict detection, which is important for all kinds of applications and already implemented in AGG. Unfortunately ...
201
Voted
ICC
2008
IEEE
16 years 27 days ago
2008
IEEE
—It is not possible to ensure that a network is absolutely secure. Therefore, network operators must continually change their defense strategies to counter attackers who constant...
193
Voted
NIPS
2004
15 years 7 months ago
2004
This paper concerns approximate nearest neighbor searching algorithms, which have become increasingly important, especially in high dimensional perception areas such as computer v...
143
click to vote
TPDS
1998
15 years 6 months ago
1998
—Array redistribution is usually required to enhance algorithm performance in many parallel programs on distributed memory multicomputers. Since it is performed at run-time, ther...
173
Voted
PPOPP
2009
ACM
16 years 7 months ago
2009
ACM
Fairness is an essential requirement of any operating system scheduler. Unfortunately, existing fair scheduling algorithms are either inaccurate or inefficient and non-scalable fo...