Sciweavers

3136 search results - page 129 / 628
» Comparison of Clique-Listing Algorithms
Sort
View
NIPS
2003
15 years 7 months ago
Learning a Distance Metric from Relative Comparisons
This paper presents a method for learning a distance metric from relative comparison such as “A is closer to B than A is to C”. Taking a Support Vector Machine (SVM) approach,...
Matthew Schultz, Thorsten Joachims
CVPR
2004
IEEE
16 years 8 months ago
Grouping with Bias Revisited
In this paper, we improve and tailor a recent statistical region merging approach to biased (partially supervised) grouping. The approach appears to be attractive both for its the...
Richard Nock, Frank Nielsen
ECCV
2000
Springer
16 years 8 months ago
Diffeomorphic Matching Problems in One Dimension: Designing and Minimizing Matching Functionals
This paper focuses on matching 1D structures by variational methods. We provide rigorous rules for the construction of the cost function, on the basis of an analysis of properties ...
Alain Trouvé, Laurent Younes
STOC
2006
ACM
166views Algorithms» more  STOC 2006»
16 years 6 months ago
The Santa Claus problem
The Santa Claus problem is an interesting exercise in concurrent programming which has been used in a comparison of the concurrency mechanisms of Ada and Java. We present a simple...
Nikhil Bansal, Maxim Sviridenko
DLOG
2011
14 years 9 months ago
Goal-oriented Query Rewriting for OWL 2 QL
We present an optimized query rewriting algorithm for OWL 2 QL that computes the rewriting set of a user query by avoiding unnecessary inferences and extended clause subsumption ch...
Alexandros Chortaras, Despoina Trivela, Giorgos B....