Sciweavers

1933 search results - page 241 / 387
» Improved Algorithms for the Feedback Vertex Set Problems
Sort
View
PKDD
2010
Springer
164views Data Mining» more  PKDD 2010»
15 years 1 months ago
Complexity Bounds for Batch Active Learning in Classification
Active learning [1] is a branch of Machine Learning in which the learning algorithm, instead of being directly provided with pairs of problem instances and their solutions (their l...
Philippe Rolet, Olivier Teytaud
CP
2011
Springer
14 years 3 months ago
Pruning Rules for Constrained Optimisation for Conditional Preferences
A depth-first search algorithm can be used to find optimal solutions of a Constraint Satisfaction Problem (CSP) with respect to a set of conditional preferences statements (e.g.,...
Nic Wilson, Walid Trabelsi
CGO
2006
IEEE
15 years 10 months ago
Fast and Effective Orchestration of Compiler Optimizations for Automatic Performance Tuning
Although compile-time optimizations generally improve program performance, degradations caused by individual techniques are to be expected. One promising research direction to ove...
Zhelong Pan, Rudolf Eigenmann
BMCBI
2010
86views more  BMCBI 2010»
15 years 4 months ago
Fast motif recognition via application of statistical thresholds
Background: Improving the accuracy and efficiency of motif recognition is an important computational challenge that has application to detecting transcription factor binding sites...
Christina Boucher, James King
CVPR
2001
IEEE
16 years 6 months ago
A Bayesian Approach to Digital Matting
This paper proposes a new Bayesian framework for solving the matting problem, i.e. extracting a foreground element from a background image by estimating an opacity for each pixel ...
Yung-Yu Chuang, Brian Curless, David Salesin, Rich...