Sciweavers

2210 search results - page 124 / 442
» CLEF 2001 - Overview of Results
Sort
View
WEBI
2001
Springer
15 years 10 months ago
On Axiomatizing Probabilistic Conditional Independencies in Bayesian Networks
Several researchers have suggested that Bayesian networks (BNs) should be used to manage the inherent uncertainty in information retrieval. However, it has been argued that manuall...
Cory J. Butz
165
Voted
WG
2001
Springer
15 years 10 months ago
Edge-Isoperimetric Problems for Cartesian Powers of Regular Graphs
We consider an edge-isoperimetric problem (EIP) on the cartesian powers of graphs. One of our objectives is to extend the list of graphs for whose cartesian powers the lexicograph...
Sergei L. Bezrukov, Robert Elsässer
WG
2001
Springer
15 years 10 months ago
Approximation of Pathwidth of Outerplanar Graphs
There exists a polynomial time algorithm to compute the pathwidth of outerplanar graphs [3], but the large exponent makes this algorithm impractical. In this paper, we give an alg...
Fedor V. Fomin, Hans L. Bodlaender
WIA
2001
Springer
15 years 10 months ago
Cascade Decompositions are Bit-Vector Algorithms
A vector algorithm is an algorithm that applies a bounded number of vector operations to an input vector, regardless of the length of the input. In this paper, we describe the link...
Anne Bergeron, Sylvie Hamel
158
Voted
3DIM
2001
IEEE
15 years 9 months ago
Robust Recognition and Pose Determination of 3-D Objects Using Range Images in Eigenspace
In this paper we propose a robust method for recognition and pose determination of 3-D objects using range images in the eigenspace approach. Instead of computing the coefficients...
Danijel Skocaj, Ales Leonardis