2168 search results - page 288 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
136
click to vote
EGH
2010
Springer
15 years 2 months ago
2010
Springer
Current GPUs rasterize micropolygons (polygons approximately one pixel in size) inefficiently. Additionally, they do not natively support triangle rasterization with jittered samp...
147
click to vote
MMSEC
2004
ACM
15 years 9 months ago
2004
ACM
Watermarking of 3D meshes has received a limited attention due to the difficulties encountered in extending the algorithms developed for 1D (audio) and 2D (images and video) signa...
138
Voted
ANCS
2007
ACM
15 years 8 months ago
2007
ACM
Network operators need high-capacity router architectures that can offer scalability, provide throughput and performance guarantees, and maintain packet ordering. However, previou...
126
Voted
CSB
2003
IEEE
15 years 9 months ago
2003
IEEE
The complexity of the global organization and internal structures of motifs in higher eukaryotic organisms raises significant challenges for motif detection techniques. To achiev...
131
click to vote
JRTIP
2008
15 years 4 months ago
2008
Abstract In an effort to achieve lower bandwidth requirements, video compression algorithms have become increasingly complex. Consequently, the deployment of these algorithms on Fi...