Sciweavers

10106 search results - page 1701 / 2022
» Algorithm Selection and Scheduling
Sort
View
CGF
2008
121views more  CGF 2008»
15 years 6 months ago
Tensor Clustering for Rendering Many-Light Animations
Rendering animations of scenes with deformable objects, camera motion, and complex illumination, including indirect lighting and arbitrary shading, is a long-standing challenge. P...
Milos Hasan, Edgar Velázquez-Armendá...
DC
2008
15 years 6 months ago
On implementing omega in systems with weak reliability and synchrony assumptions
We study the feasibility and cost of implementing --a fundamental failure detector at the core of many algorithms--in systems with weak reliability and synchrony assumptions. Intui...
Marcos Kawazoe Aguilera, Carole Delporte-Gallet, H...
EOR
2008
111views more  EOR 2008»
15 years 6 months ago
Machine-part cell formation in group technology using a modified ART1 method
Group Technology (GT) is a useful way of increasing the productivity for manufacturing high quality products and improving the flexibility of manufacturing systems. Cell formation...
Miin-Shen Yang, Jenn-Hwai Yang
DATAMINE
2006
127views more  DATAMINE 2006»
15 years 6 months ago
Computing LTS Regression for Large Data Sets
Least trimmed squares (LTS) regression is based on the subset of h cases (out of n) whose least squares t possesses the smallest sum of squared residuals. The coverage h may be se...
Peter Rousseeuw, Katrien van Driessen
JACM
2006
99views more  JACM 2006»
15 years 6 months ago
Finding a maximum likelihood tree is hard
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
Benny Chor, Tamir Tuller
« Prev « First page 1701 / 2022 Last » Next »