Sciweavers

2018 search results - page 204 / 404
» Magnitude-preserving ranking algorithms
Sort
View
ICPR
2004
IEEE
16 years 7 months ago
Perceptual Grouping for Contour Extraction
This paper describes an algorithm that efficiently groups line segments into perceptually salient contours in complex images. A measure of affinity between pairs of lines is used ...
Francisco J. Estrada, Allan D. Jepson
CODES
2005
IEEE
16 years 3 days ago
An integer linear programming approach for identifying instruction-set extensions
This paper presents an Integer Linear Programming (ILP) approach to the instruction-set extension identification problem. An algorithm that iteratively generates and solves a set...
Kubilay Atasu, Günhan Dündar, Can C. &Ou...
TACAS
2005
Springer
78views Algorithms» more  TACAS 2005»
15 years 12 months ago
Separating Fairness and Well-Foundedness for the Analysis of Fair Discrete Systems
Fair discrete systems (FDSs) are a computational model of concurrent programs where fairness assumptions are specified in terms of sets of states. The analysis of fair discrete sy...
Amir Pnueli, Andreas Podelski, Andrey Rybalchenko
ANTS
2008
Springer
108views Algorithms» more  ANTS 2008»
15 years 8 months ago
Some Improvements to 4-Descent on an Elliptic Curve
The theory of 4-descent on elliptic curves has been developed in the PhD theses of Siksek [18], Womack [21] and Stamminger [20]. Prompted by our use of 4-descent in the search for ...
Tom Fisher
CORR
2006
Springer
126views Education» more  CORR 2006»
15 years 6 months ago
Evaluating the Robustness of Learning from Implicit Feedback
This paper evaluates the robustness of learning from implicit feedback in web search. In particular, we create a model of user behavior by drawing upon user studies in laboratory ...
Filip Radlinski, Thorsten Joachims