186
Voted
ARITH
1999
IEEE
16 years 10 hour ago
1999
IEEE
A digit-recurrence algorithm for computing the Euclidean norm of a 3-dimensional vector is proposed. Starting from the vector component with the highest order of magnitude as the ...
214
Voted
ECCV
2000
Springer
16 years 23 hour ago
2000
Springer
A new approach to characterizing the performance of point-correspondence algorithms is presented. Instead of relying on any \ground truth', it uses the self-consistency of th...
202
Voted
ECCV
2000
Springer
16 years 23 hour ago
2000
Springer
Abstract. Condensation is a popular algorithm for sequential inference that resamples a sampled representation of the posterior. The algorithm is known to be asymptotically correct...
210
click to vote
ECAI
2000
Springer
16 years 1 days ago
2000
Springer
Abstract. Scheduling meetings is generally difficult in that it attempts to satisfy the preferences of all participants. However, all participants can agree to a schedule in which...
199
Voted
ECAI
2000
Springer
16 years 1 days ago
2000
Springer
This position paper presents an algorithm, which determines similarities between text documents. These text documents are indexed with keywords and further background knowledge-ter...
218
Voted
ECAI
2000
Springer
16 years 1 days ago
2000
Springer
In this paper, an editing algorithm based on the projection of the examples in each dimension is presented. The algorithm, that we have called EOP (Editing by Ordered Projection) h...
193
Voted
ICPR
2010
IEEE
16 years 1 days ago
2010
IEEE
In this paper, we present a monocular camera based terrain classification scheme. The uniqueness of the proposed scheme is that it inherently incorporates spatial smoothness while...
171
Voted
CL
2000
Springer
16 years 1 days ago
2000
Springer
We introduce an algorithm for cooperative planning in multi-agent systems. The algorithm enables the agents to combine (fuse) their plans in order to increase their joint profits...
202
Voted
CIKM
2000
Springer
16 years 1 days ago
2000
Springer
RankBoost is a recently proposed algorithm for learning ranking functions. It is simple to implement and has strong justifications from computational learning theory. We describe...
187
Voted
CIAC
2000
Springer
16 years 1 days ago
2000
Springer
We consideralgorithms for a simple one-dimensionalpoint placement problem: given N points on a line, and noisy measurements of the distances between many pairs of them, estimate th...