415 search results - page 22 / 83 » Optimally Reconstructing Weighted Graphs Using Queries |
ADBIS
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. The performance of an information retrieval system is usually measured in terms of two different criteria, precision and recall. This way, the optimization of any of its...
ECML
2006
Springer
13 years 11 months ago
2006
Springer
We propose preprocessing spectral clustering with b-matching to remove spurious edges in the adjacency graph prior to clustering. B-matching is a generalization of traditional maxi...
WADS
2007
Springer
14 years 3 months ago
2007
Springer
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
ECCV
2002
Springer
14 years 11 months ago
2002
Springer
In the last few years, several new algorithms based on graph cuts have been developed to solve energy minimization problems in computer vision. Each of these techniques constructs...
MLG
2007
Springer
14 years 3 months ago
2007
Springer
1 In web-related applications of image categorization, it is desirable to derive an interpretable classification rule with high accuracy. Using the bag-of-words representation and...