Sciweavers

562 search results - page 51 / 113
» Dependency Pairs Revisited
Sort
View
HM
2007
Springer
107views Optimization» more  HM 2007»
15 years 8 months ago
A Memetic Algorithm for the Optimum Communication Spanning Tree Problem
For the NP-hard Optimum Communication Spanning Tree (OCST) problem a cost minimizing spanning tree has to be found, where the cost depends on the communication volume between each ...
Thomas Fischer, Peter Merz
RTA
2005
Springer
15 years 7 months ago
Orderings for Innermost Termination
Abstract. This paper shows that the suitable orderings for proving innermost termination are characterized by the innermost parallel monotonicity, IP-monotonicity for short. This p...
Mirtha-Lina Fernández, Guillem Godoy, Alber...
ICIAP
1999
ACM
15 years 6 months ago
Learning Visual Operators from Examples: A New Paradigm in Image Processing
This paper presents a general strategy for designing efficient visual operators. The approach is highly task oriented and what constitutes the relevant information is defined by...
Hans Knutsson, Magnus Borga
NIPS
2008
15 years 3 months ago
Kernelized Sorting
Object matching is a fundamental operation in data analysis. It typically requires the definition of a similarity measure between the classes of objects to be matched. Instead, we...
Novi Quadrianto, Le Song, Alex J. Smola
ESANN
2001
15 years 3 months ago
Canonical correlation analysis in early vision processing
This paper illustrates how canonical correlation analysis can be used for designing efficient visual operators by learning. The approach is highly task oriented and what constitute...
Magnus Borga, Hans Knutsson