151 search results - page 23 / 31 » Computable Shell Decomposition Bounds |
128
Voted
SIAMCOMP
1998
15 years 1 months ago
1998
This paper describes new methods for maintaining a point-location data structure for a dynamically changing monotone subdivision S. The main approach is based on the maintenance of...
113
click to vote
CVPR
2010
IEEE
15 years 10 months ago
2010
IEEE
Many computer vision problems involving feature correspondence among images can be formulated as an assignment problem with a quadratic cost function. Such problems are computatio...
133
click to vote
FCT
2009
Springer
15 years 5 months ago
2009
Springer
We show that the reachability problem for directed graphs that are either K3,3-free or K5-free is in unambiguous log-space, UL coUL. This significantly extends the result of Bour...
119
Voted
ARC
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. Monte Carlo simulation is one of the most widely used techniques for computationally intensive simulations in mathematical analysis and modeling. A multivariate Gaussian ...
112
click to vote
SIGGRAPH
2009
ACM
15 years 8 months ago
2009
ACM
We present a novel parallel continuous collision detection (PCCD) method to utilize the widely available multi-core CPU architecture. Our method works with a wide variety of defor...