3958 search results - page 386 / 792 » Dynamic Graph Algorithms with Applications |
188
click to vote
VLSI
2010
Springer
15 years 1 months ago
2010
Springer
Multi-FPGA systems (MFS's) represent a promising technology for various applications, such as the implementation of supercomputers and parallel and computational intensive emu...
180
click to vote
KDD
2004
ACM
16 years 7 months ago
2004
ACM
We report on an automated runtime anomaly detection method at the application layer of multi-node computer systems. Although several network management systems are available in th...
160
click to vote
IPPS
2007
IEEE
16 years 1 months ago
2007
IEEE
Due to fundamental physical limitations and power constraints, we are witnessing a radical change in commodity microprocessor architectures to multicore designs. Continued perform...
176
click to vote
SPAA
2005
ACM
16 years 10 days ago
2005
ACM
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
170
Voted
CVPR
2000
IEEE
15 years 11 months ago
2000
IEEE
We use cluster analysis as a unifying principle for problems from low, middle and high level vision. The clustering problem is viewed as graph partitioning, where nodes represent ...