1529 search results - page 40 / 306 » A slant removal algorithm |
102
click to vote
ICIP
1998
IEEE
16 years 2 months ago
1998
IEEE
We present an algorithm that efficiently tracks a predefined set of landmark points in a time sequence of images. The algorithm iteratively optimizes the correspondences between t...
107
Voted
COCOON
2005
Springer
15 years 6 months ago
2005
Springer
The Reverse Greedy algorithm (RGREEDY) for the k-median problem works as follows. It starts by placing facilities on all nodes. At each step, it removes a facility to minimize the...
105
Voted
ICC
2000
IEEE
15 years 5 months ago
2000
IEEE
This paper proposes an approach to Traffic Engineering that uses Differentiated Services (diffserv) and Multi-Protocol Label Switching (MPLS) to provide quantitative QoS guarantees...
BIOINFORMATICS
2000
15 years 12 days ago
2000
Motivation: Efficient, accurate and automatic clustering of large protein sequence datasets, such as complete proteomes, into families, according to sequence similarity. Detection...
99
Voted
SAC
2008
ACM
15 years 1 days ago
2008
ACM
The Tukey depth (Tukey 1975) of a point p with respect to a finite set S of points is the minimum number of elements of S contained in any closed halfspace that contains p. Algori...