Sciweavers

7405 search results - page 204 / 1481
» Computer Graphics
Sort
View
DCC
2006
IEEE
16 years 1 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
108
Voted
GD
2006
Springer
15 years 5 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
DAC
2006
ACM
15 years 7 months ago
Signature-based workload estimation for mobile 3D graphics
Until recently, most 3D graphics applications had been regarded as too computationally intensive for devices other than desktop computers and gaming consoles. This notion is rapid...
Bren Mochocki, Kanishka Lahiri, Srihari Cadambi, X...
104
Voted
ICMCS
2006
IEEE
143views Multimedia» more  ICMCS 2006»
15 years 7 months ago
Automatic Classification of Photographs and Graphics
In general, digital images can be classified into photographs and computer graphics. This taxonomy is very useful in many applications, such as web image search. However, there ar...
Yuanhao Chen, Zhiwei Li, Mingjing Li, Wei-Ying Ma
102
Voted
TOG
2002
134views more  TOG 2002»
15 years 1 months ago
The SAGE graphics architecture
The Scalable, Advanced Graphics Environment (SAGE) is a new high-end, multi-chip rendering architecture. Each single SAGE board can render in excess of 80 million fully lit, textu...
Michael Deering, David Naegle