4302 search results - page 347 / 861 » Index Pairs Algorithms |
127
click to vote
MDM
2004
Springer
15 years 10 months ago
2004
Springer
TPR-tree is a practical index structure for moving object databases. Due to the uniform distribution assumption, TPR-tree’s bulk loading algorithm (TPR) is relatively inefficie...
146
Voted
IJAC
2008
15 years 5 months ago
2008
We give an efficient algorithm to randomly generate finitely generated subgroups of a given size, in a finite rank free group. Here, the size of a subgroup is the number of vertic...
150
click to vote
FUIN
2007
15 years 4 months ago
2007
Intercodes are a generalization of comma-free codes. Using the structural properties of finite-state automata recognizing an intercode we develop a polynomial-time algorithm for d...
129
click to vote
COMPGEOM
2004
ACM
15 years 10 months ago
2004
ACM
We study the problem of computing the visibility graph defined by a set P of n points inside a polygon Q: two points p, q ∈ P are joined by an edge if the segment pq ⊂ Q. Ef...
143
click to vote
CVPR
2004
IEEE
16 years 7 months ago
2004
IEEE
It is a well known classical result that given the image projections of three known world points it is possible to solve for the pose of a calibrated perspective camera to up to f...