Sciweavers

4860 search results - page 727 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
CAD
2008
Springer
15 years 6 months ago
Improved Binary Space Partition merging
This paper presents a new method for evaluating boolean set operations between Binary Space Partition (BSP) trees. Our algorithm has many desirable features including both numeric...
Mikola Lysenko, Roshan D'Souza, Ching-Kuan Shene
CG
2008
Springer
15 years 6 months ago
Practical global illumination for interactive particle visualization
Particle-based simulation methods are used to model a wide range of complex phenomena and to solve time-dependent problems of various scales. Effective visualizations of the resul...
Christiaan P. Gribble, Carson Brownlee, Steven G. ...
CGF
2007
158views more  CGF 2007»
15 years 6 months ago
Soft Articulated Characters with Fast Contact Handling
Fast contact handling of soft articulated characters is a computationally challenging problem, in part due to complex interplay between skeletal and surface deformation. We presen...
Nico Galoppo, Miguel A. Otaduy, Serhat Tekin, Mark...
JCM
2006
118views more  JCM 2006»
15 years 6 months ago
Joint Optimization of Local and Fusion Rules in a Decentralized Sensor Network
Decentralized sensor networks are collections of individual local sensors that observe a common phenomenon, quantize their observations, and send this quantized information to a ce...
Nithya Gnanapandithan, Balasubramaniam Natarajan
MP
2006
87views more  MP 2006»
15 years 6 months ago
Convexity and decomposition of mean-risk stochastic programs
Abstract. Traditional stochastic programming is risk neutral in the sense that it is concerned with the optimization of an expectation criterion. A common approach to addressing ri...
Shabbir Ahmed