Sciweavers

4843 search results - page 211 / 969
» The Shortcut Problem - Complexity and Approximation
Sort
View
129
Voted
KDD
2000
ACM
115views Data Mining» more  KDD 2000»
15 years 7 months ago
A framework for specifying explicit bias for revision of approximate information extraction rules
Information extraction is one of the most important techniques used in Text Mining. One of the main problems in building information extraction (IE) systems is that the knowledge ...
Ronen Feldman, Yair Liberzon, Binyamin Rosenfeld, ...
161
Voted
ICALP
2009
Springer
16 years 3 months ago
SDP-Based Algorithms for Maximum Independent Set Problems on Hypergraphs
Abstract. This paper deals with approximations of maximum independent sets in non-uniform hypergraphs of low degree. We obtain the first performance ratio that is sublinear in term...
Elena Losievskaja, Geir Agnarsson, Magnús M...
111
Voted
ECML
2007
Springer
15 years 9 months ago
Transfer Learning in Reinforcement Learning Problems Through Partial Policy Recycling
In this paper we investigate the relation between transfer learning in reinforcement learning with function approximation and supervised learning with concept drift. We present a n...
Jan Ramon, Kurt Driessens, Tom Croonenborghs
CSCLP
2004
Springer
15 years 8 months ago
Better Propagation for Non-preemptive Single-Resource Constraint Problems
Abstract. Overload checking, forbidden regions, edge finding, and notfirst/not-last detection are well-known propagation rules to prune the start times of activities which have t...
Armin Wolf
104
Voted
JSCIC
2008
79views more  JSCIC 2008»
15 years 3 months ago
A New Ghost Cell/Level Set Method for Moving Boundary Problems: Application to Tumor Growth
Abstract In this paper, we present a ghost cell/level set method for the evolution of interfaces whose normal velocity depend upon the solutions of linear and nonlinear quasi-stead...
Paul Macklin, John Lowengrub