Sciweavers

5128 search results - page 800 / 1026
» Discrete Component Analysis
Sort
View
SI3D
2005
ACM
16 years 4 days ago
Towards space: time light field rendering
So far extending light field rendering to dynamic scenes has been trivially treated as the rendering of static light fields stacked in time. This type of approaches requires inp...
Huamin Wang, Ruigang Yang
GECCO
2005
Springer
125views Optimization» more  GECCO 2005»
16 years 3 days ago
Schema disruption in tree-structured chromosomes
We study if and when the inequality dp(H) ≤ rel∆(H) holds for schemas H in chromosomes that are structured as trees. The disruption probability dp(H) is the probability that a...
William A. Greene
CASES
2004
ACM
16 years 10 hour ago
Analytical computation of Ehrhart polynomials: enabling more compiler analyses and optimizations
Many optimization techniques, including several targeted specifically at embedded systems, depend on the ability to calculate the number of elements that satisfy certain conditio...
Sven Verdoolaege, Rachid Seghir, Kristof Beyls, Vi...
DOCENG
2004
ACM
16 years 9 hour ago
A three-way merge for XML documents
Three-way merging is a technique that may be employed for reintegrating changes to a document in cases where multiple independently modified copies have been made. While tools fo...
Tancred Lindholm
ISPD
2004
ACM
189views Hardware» more  ISPD 2004»
16 years 8 hour ago
Almost optimum placement legalization by minimum cost flow and dynamic programming
VLSI placement tools usually work in two steps: First, the cells that have to be placed are roughly spread out over the chip area ignoring disjointness (global placement). Then, i...
Ulrich Brenner, Anna Pauli, Jens Vygen