3890 search results - page 352 / 778 » Computation of unirational fields |
184
click to vote
FCCM
2003
IEEE
16 years 26 days ago
2003
IEEE
FPGAs have appealing features such as customizable internal and external bandwidth and the ability to exploit vast amounts of fine-grain parallelism. In this paper we explore the ...
226
click to vote
CA
1998
IEEE
15 years 12 months ago
1998
IEEE
Shadows are of great importance to computer graphics, especially for interactive animation due to the visual cues which they provide. Most research in the field of dynamic shadowi...
167
click to vote
CGI
2004
IEEE
15 years 11 months ago
2004
IEEE
We give an efficient, scalable, and simple algorithm for computation of a central path for navigation in closed virtual environments. The algorithm requires less preprocessing and...
229
click to vote
CLOUDCOM
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Grid computing is based on coordinated resource sharing in a dynamic environment of multi-institutional virtual organizations. Data exchanges, and service allocation, are...
198
click to vote
DIS
2008
Springer
15 years 9 months ago
2008
Springer
Frequent closures (FCIs) and generators (FGs) as well as the precedence relation on FCIs are key components in the definition of a variety of association rule bases. Although their...