9405 search results - page 1032 / 1881 » Computing a Model of Set Theory |
214
click to vote
JGS
2010
15 years 2 months ago
2010
Despite the fact that it provides a potentially useful analytical tool, allowing for the joint modeling of dynamic interdependencies within a group of connected areas, until latel...
204
click to vote
ICPR
2006
IEEE
16 years 8 months ago
2006
IEEE
Correspondence algorithms typically struggle with shapes that display part-based variation. We present a probabilistic approach that matches shapes using independent part transfor...
200
click to vote
CVPR
1998
IEEE
15 years 12 months ago
1998
IEEE
We present a method for matching curves which accommodates large and small deformation. The method preserves geometric similarities in the case of small deformation, and loosens t...
200
click to vote
SODA
1994
ACM
15 years 9 months ago
1994
ACM
We maintain the maximum spanning tree of a planar point set, as points are inserted or deleted, in O(log3 n) time per update in Mulmuley's expected-case model of dynamic geom...
185
click to vote
IPPS
2010
IEEE
15 years 5 months ago
2010
IEEE
We propose a novel approach, called Dynamic Fractional Resource Scheduling (DFRS), to share homogeneous cluster computing platforms among competing jobs. DFRS leverages virtual mac...