19866 search results - page 173 / 3974 » Computing all factorizations in *** |
180
click to vote
ISPAN
1997
IEEE
15 years 10 months ago
1997
IEEE
This paper presents a strategy for efficiently rendering time-varying volume data on a distributed-memory parallel computer. Visualizing time-varying volume data take both large s...
169
click to vote
ECCV
2002
Springer
16 years 8 months ago
2002
Springer
Establishing point correspondences between images is a key step for 3D-shape computation. Nevertheless, shape extraction and point correspondence are treated, usually, as two diffe...
175
click to vote
FPL
2006
Springer
15 years 10 months ago
2006
Springer
Computing applications in FPGAs are commonly built from repetitive structures of computing and/or memory elements. In many cases, application performance depends on the degree of ...
164
click to vote
ISCC
2002
IEEE
15 years 11 months ago
2002
IEEE
: - Efficient task scheduling is essential for achieving high performance computing applications for distributed systems. Most of existing real-time systems consider schedulability...
192
click to vote
CRYPTO
2001
Springer
15 years 11 months ago
2001
Springer
Consider a scenario where an l-bit secret has been distributed among n players by an honest dealer using some secret sharing scheme. Then, if all players behave honestly, the secre...