6365 search results - page 923 / 1273 » Fast Local Computation Algorithms |
232
click to vote
HPCC
2011
Springer
14 years 6 months ago
2011
Springer
— Mapping of parallel applications on the network topology is becoming increasingly important on large supercomputers. Topology aware mapping can reduce the hops traveled by mess...
261
Voted
CVPR
2012
IEEE
13 years 9 months ago
2012
IEEE
In this paper, we tackle the problem of understanding the temporal structure of complex events in highly varying videos obtained from the Internet. Towards this goal, we utilize a...
199
click to vote
SI3D
2003
ACM
16 years 2 days ago
2003
ACM
We present a new algorithm for best-effort simplification of polygonal meshes based on principles of visual perception. Building on previous work, we use a simple model of low-lev...
241
click to vote
TVCG
2011
15 years 1 months ago
2011
—This paper considers the problem of interactively finding the cutting contour to extract components from an existing mesh. First, we propose a constrained random walks algorith...
224
click to vote
BMCBI
2011
15 years 1 months ago
2011
Background: The prediction of the structure of large RNAs remains a particular challenge in bioinformatics, due to the computational complexity and low levels of accuracy of state...