Sciweavers

1529 search results - page 169 / 306
» Search Space Analysis of the Linear Ordering Problem
Sort
View
ILP
2004
Springer
15 years 9 months ago
Learning an Approximation to Inductive Logic Programming Clause Evaluation
One challenge faced by many Inductive Logic Programming (ILP) systems is poor scalability to problems with large search spaces and many examples. Randomized search methods such as ...
Frank DiMaio, Jude W. Shavlik
MOR
2002
94views more  MOR 2002»
15 years 4 months ago
The Complexity of Generic Primal Algorithms for Solving General Integer Programs
ngly better objective function value until an optimal solution is reached. From an abstract point of view, an augmentation problem is solved in each iteration. That is, given a fea...
Andreas S. Schulz, Robert Weismantel
SISAP
2010
IEEE
135views Data Mining» more  SISAP 2010»
15 years 2 months ago
Improving the similarity search of tandem mass spectra using metric access methods
In biological applications, the tandem mass spectrometry is a widely used method for determining protein and peptide sequences from an ”in vitro” sample. The sequences are not...
Jiri Novák, Tomás Skopal, David Hoks...
CVPR
2006
IEEE
16 years 6 months ago
An Intensity-augmented Ordinal Measure for Visual Correspondence
Determining the correspondence of image patches is one of the most important problems in Computer Vision. When the intensity space is variant due to several factors such as the ca...
Anurag Mittal, Visvanathan Ramesh
161
Voted
EKAW
2004
Springer
15 years 9 months ago
A Topic-Based Browser for Large Online Resources
The exploration of large information spaces is a difficult task, especially if the user is not familiar with the terminology used to describe information. Conceptual models of a do...
Heiner Stuckenschmidt, Anita de Waard, Ravinder Bh...