336 search results - page 18 / 68 » Analytic Cut Trees |
CGF
2002
13 years 7 months ago
2002
BSP trees and KD trees are fundamental data structures for collision detection in walkthrough environments. A basic issue in the construction of these hierarchical data structures...
PKDD
2005
Springer
14 years 1 months ago
2005
Springer
This paper presents an unsupervised discretization method that performs density estimation for univariate data. The subintervals that the discretization produces can be used as the...
DGO
2009
13 years 8 months ago
2009
This paper addresses challenges to resource managers' use of scientific research, and reports strategies and informatics tools to ameliorate those challenges. Our work involv...
CCO
2001
Springer
14 years 4 days ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
ICFP
2005
ACM
14 years 7 months ago
2005
ACM
Monads are commonplace programming devices that are used to uniformly structure computations with effects such as state, exceptions, and I/O. This paper further develops the monad...