56 search results - page 2 / 12 » Dynamically Partitioning for Solving QBF |
SIAMCOMP
1998
13 years 7 months ago
1998
We describe a new randomized data structure, the sparse partition, for solving the dynamic closest-pair problem. Using this data structure the closest pair of a set of n points in ...
ICIP
2008
IEEE
14 years 1 months ago
2008
IEEE
In this paper, we propose a new fast semi-supervised image segmentation method based on augmented tree partitioning. Unlike many existing methods that use a graph structure to mod...
IPPS
2003
IEEE
14 years 21 days ago
2003
IEEE
Numerical methods for solving the systems of partial differential equations arising in geophysical fluid dynamics rely on a variety of spatial discretization schemes (e.g. finit...
ICNP
2000
IEEE
13 years 12 months ago
2000
IEEE
Multicast sessions may have a large number of receivers with heterogeneous reception capacities. To accommodate this heterogeneity, various multi-rate schemes, based upon the use ...
KDD
2006
ACM
14 years 7 months ago
2006
ACM
Partitions of sequential data exist either per se or as a result of sequence segmentation algorithms. It is often the case that the same timeline is partitioned in many different ...