Sciweavers

7465 search results - page 254 / 1493
» Point-based Computer graphics
Sort
View
APGV
2008
ACM
164views Visualization» more  APGV 2008»
15 years 8 months ago
Quantifying usability in secure graphics: assessing the user costs of protecting 3D content
There is an increasing need for methods for secure dissemination of interactive 3D graphics content, providing protection for valuable 3D models while still allowing them to be wi...
Jiajun Zhu, Jonathan Z. Bakdash, David Koller, Tho...
JPDC
2008
167views more  JPDC 2008»
15 years 6 months ago
A performance study of general-purpose applications on graphics processors using CUDA
Graphics processors (GPUs) provide a vast number of simple, data-parallel, deeply multithreaded cores and high memory bandwidths. GPU architectures are becoming increasingly progr...
Shuai Che, Michael Boyer, Jiayuan Meng, David Tarj...
DCC
2008
IEEE
16 years 6 months ago
A Simple Algorithm for Computing the Lempel Ziv Factorization
We give a space-efficient simple algorithm for computing the Lempel?Ziv factorization of a string. For a string of length n over an integer alphabet, it runs in O(n) time independ...
Maxime Crochemore, Lucian Ilie, W. F. Smyth
DCC
2006
IEEE
16 years 6 months ago
Efficient Computation of Roots in Finite Fields
We present an algorithm to compute r-th roots in Fqm with complexity O((log m + r log q)m2 log2 q) for certain choices of m and q. This compares well to previously known algorithms...
Paulo S. L. M. Barreto, José Felipe Voloch
GD
2006
Springer
15 years 10 months ago
Computing Geometric Minimum-Dilation Graphs Is NP-Hard
We prove that computing a geometric minimum-dilation graph on a given set of points in the plane, using not more than a given number of edges, is an NP-hard problem, no matter if ...
Rolf Klein, Martin Kutz