Sciweavers

3715 search results - page 350 / 743
» A Space Optimization for FP-Growth
Sort
View
EMMCVPR
2001
Springer
15 years 11 months ago
Path Based Pairwise Data Clustering with Application to Texture Segmentation
Most cost function based clustering or partitioning methods measure the compactness of groups of data. In contrast to this picture of a point source in feature space, some data sou...
Bernd Fischer, Thomas Zöller, Joachim M. Buhm...
SIGGRAPH
2010
ACM
15 years 11 months ago
Image warps for artistic perspective manipulation
Painters and illustrators commonly sketch vanishing points and lines to guide the construction of perspective images. We present a tool that gives users the ability to manipulate ...
Robert Carroll, Aseem Agarwala, Maneesh Agrawala
COMPGEOM
2000
ACM
15 years 11 months ago
Kinetic connectivity for unit disks
We describe a kinetic data structure (KDS) that maintains the connected components of the union of a set of unit-radius disks moving in the plane. We assume that the motion of eac...
Leonidas J. Guibas, John Hershberger, Subhash Suri...
WADS
1997
Springer
91views Algorithms» more  WADS 1997»
15 years 11 months ago
Dynamic Motion Planning in Low Obstacle Density Environments
A fundamental task for an autonomous robot is to plan its own motions. Exact approaches to the solution of this motion planning problem suffer from high worst-case running times. ...
Robert-Paul Berretty, Mark H. Overmars, A. Frank v...
ICALP
2007
Springer
15 years 10 months ago
In-Place Suffix Sorting
Given string T = T[1, . . . , n], the suffix sorting problem is to lexicographically sort the suffixes T[i, . . . , n] for all i. This problem is central to the construction of suf...
Gianni Franceschini, S. Muthukrishnan