Sciweavers

5055 search results - page 736 / 1011
» Relative Timing
Sort
View
IJCAI
2003
15 years 8 months ago
Amalgams of Constraint Satisfaction Problems
Many of standard practical techniques of solving constraint satisfaction problems use various decomposition methods to represent a problem as a combination of smaller ones. We stu...
Andrei A. Bulatov, Evgeny S. Skvortsov
SODA
2004
ACM
104views Algorithms» more  SODA 2004»
15 years 8 months ago
Tight bounds for the partial-sums problem
We close the gaps between known lower and upper bounds for the online partial-sums problem in the RAM and group models of computation. If elements are chosen from an abstract grou...
Mihai Patrascu, Erik D. Demaine
ISCAPDCS
2003
15 years 8 months ago
Using Kernel Coupling to Improve the Performance of Multithreaded Applications
Kernel coupling refers to the effect that kernel i has on kernel j in relation to running each kernel in isolation. The two kernels can correspond to adjacent kernels or a chain ...
Jonathan Geisler, Valerie E. Taylor, Xingfu Wu, Ri...
WSCG
2004
145views more  WSCG 2004»
15 years 8 months ago
Introducing Sweep Features in Modeling with Subdivision Surfaces
In recent times, subdivision surfaces have been considered a powerful representation for shape design. They have been successfully introduced in character animation software packa...
Chiara Eva Catalano, Franca Giannini, Bianca Falci...
WSCG
2004
142views more  WSCG 2004»
15 years 8 months ago
Collision Detection Using Polar Diagrams
In Computer Graphics, Collision Detection is considered a key problem with important applications in related areas. Several solutions have been proposed, but independently of the ...
Lidia M. Ortega, Francisco R. Feito, Clara I. Grim...