Sciweavers

3250 search results - page 84 / 650
» Parameterized Learning Complexity
Sort
View
KDD
2006
ACM
134views Data Mining» more  KDD 2006»
16 years 1 months ago
Learning to rank networked entities
Several algorithms have been proposed to learn to rank entities modeled as feature vectors, based on relevance feedback. However, these algorithms do not model network connections...
Alekh Agarwal, Soumen Chakrabarti, Sunny Aggarwal
ECTEL
2006
Springer
15 years 4 months ago
Community Based Software Development - the Case of Movelex
Abstract. The paper provides an overview of the elaboration, testing and improvement of Movelex, a complex virtual learning environment (VLE) supporting the establishment of self-r...
Kornél Varga, Andrea Kárpáti
GECCO
2009
Springer
167views Optimization» more  GECCO 2009»
15 years 7 months ago
Fixed-parameter evolutionary algorithms and the vertex cover problem
In this paper, we consider multi-objective evolutionary algorithms for the Vertex Cover problem in the context of parameterized complexity. We relate the runtime of our algorithms...
Stefan Kratsch, Frank Neumann
IJCV
2000
230views more  IJCV 2000»
15 years 13 days ago
Design and Use of Linear Models for Image Motion Analysis
Linear parameterized models of optical flow, particularly affine models, have become widespread in image motion analysis. The linear model coefficients are straightforward to estim...
David J. Fleet, Michael J. Black, Yaser Yacoob, Al...
DSL
2009
14 years 10 months ago
CLOPS: A DSL for Command Line Options
Programmers often write custom parsers for the command line input of their programs. They do so, in part, because they believe that both their program's parameterization and t...
Mikolás Janota, Fintan Fairmichael, Viliam ...