Sciweavers

10608 search results - page 593 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
AAI
2006
71views more  AAI 2006»
15 years 7 months ago
Textual Article Clustering in Newspaper Pages
In the analysis of a newspaper page an important step is the clustering of various text blocks into logical units, i.e., into articles. We propose three algorithms based on text p...
Marco Aiello, Andrea Pegoretti
CORR
2006
Springer
102views Education» more  CORR 2006»
15 years 7 months ago
Approximate Linear Time ML Decoding on Tail-Biting Trellises in Two Rounds
A linear time approximate maximum likelihood decoding algorithm on tail-biting trellises is presented, that requires exactly two rounds on the trellis. This is an adaptation of an ...
K. Murali Krishnan, Priti Shankar
CORR
2006
Springer
95views Education» more  CORR 2006»
15 years 7 months ago
Solving Sparse Integer Linear Systems
We propose a new algorithm to solve sparse linear systems of equations over the integers. This algorithm is based on a p-adic lifting technique combined with the use of block matr...
Wayne Eberly, Mark Giesbrecht, Pascal Giorgi, Arne...
RAS
2006
92views more  RAS 2006»
15 years 7 months ago
Trajectory generation and control for four wheeled omnidirectional vehicles
This paper describes an algorithm to calculate near-optimal minimum time trajectories for four wheeled omnidirectional vehicles, which can be used as part of a high-level path pla...
Oliver Purwin, Raffaello D'Andrea
IJCGA
2002
69views more  IJCGA 2002»
15 years 7 months ago
On Deletion in Delaunay Triangulations
This paper presents how the space of spheres and shelling may be used to delete a point from a d-dimensional triangulation efficiently. In dimension two, if k is the degree of the...
Olivier Devillers