Sciweavers

2626 search results - page 370 / 526
» The complexity of stochastic sequences
Sort
View
WSCG
2004
161views more  WSCG 2004»
15 years 8 months ago
Rendering Techniques for Hardware-Accelerated Image-Based CSG
Image-based CSG rendering algorithms for standard graphics hardware rely on multipass rendering that includes reading and writing large amounts of pixel data from and to the frame...
Florian Kirsch, Jürgen Döllner
DMDW
2000
161views Management» more  DMDW 2000»
15 years 8 months ago
View materialization for nested GPSJ queries
View materialization is a central issue in logical design of data warehouses since it is one of the most powerful techniques to improve the response to the workload. Most approach...
Matteo Golfarelli, Stefano Rizzi
AMW
2009
15 years 7 months ago
Identifying Algebraic Properties to Support Optimization of Unary Similarity Queries
Conventional operators for data retrieval are either based on exact matching or on total order relationship among elements. Neither of them is appropriate to manage complex data, s...
Mônica Ribeiro Porto Ferreira, Agma J. M. Tr...
CORR
2008
Springer
82views Education» more  CORR 2008»
15 years 6 months ago
Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation
Kaltofen has proposed a new approach in (Kaltofen, 1992) for computing matrix determinants without divisions. The algorithm is based on a baby steps/giant steps construction of Kr...
Gilles Villard
EOR
2006
87views more  EOR 2006»
15 years 6 months ago
Applying machine based decomposition in 2-machine flow shops
The Shifting Bottleneck (SB) heuristic is among the most successful approximation methods for solving the Job Shop problem. It is essentially a machine based decomposition procedu...
Saral Mukherjee, A. K. Chatterjee