10988 search results - page 162 / 2198 » Algorithmic Folding Complexity |
165
Voted
SI3D
2003
ACM
15 years 8 months ago
2003
ACM
: We present occlusion-switches for interactive visibility culling in complex 3D environments. An occlusionswitch consists of two GPUs (graphics processing units) and each GPU is u...
145
Voted
ICIP
2000
IEEE
15 years 7 months ago
2000
IEEE
Efficient compression algorithms generally use wavelet transforms. They try to exploit all the signal dependencies that can appear inside and across the different sub-bands of th...
142
Voted
INFOCOM
1995
IEEE
15 years 7 months ago
1995
IEEE
—In this paper, we derive a time-complexity bound for the gradient projection method for optimal routing in data networks. This result shows that the gradient projection algorith...
124
click to vote
CPM
2008
Springer
15 years 5 months ago
2008
Springer
The Sort Transform (ST) can significantly speed up the block sorting phase of the Burrows-Wheeler transform (BWT) by sorting only limited order contexts. However, the best result o...
115
click to vote
JETAI
2007
15 years 3 months ago
2007
The Internet has led to the development of on-line markets, and computer scientists have designed various auction algorithms, as well as automated exchanges for standardized commo...