Sciweavers

489 search results - page 30 / 98
» Approximation Algorithms for the Minimum-Length Corridor and...
Sort
View
IJCAI
2007
13 years 10 months ago
Change of Representation for Statistical Relational Learning
Statistical relational learning (SRL) algorithms learn statistical models from relational data, such as that stored in a relational database. We previously introduced view learnin...
Jesse Davis, Irene M. Ong, Jan Struyf, Elizabeth S...
KDD
2005
ACM
103views Data Mining» more  KDD 2005»
14 years 9 months ago
Fast discovery of unexpected patterns in data, relative to a Bayesian network
We consider a model in which background knowledge on a given domain of interest is available in terms of a Bayesian network, in addition to a large database. The mining problem is...
Szymon Jaroszewicz, Tobias Scheffer
JAIR
2010
145views more  JAIR 2010»
13 years 7 months ago
Planning with Noisy Probabilistic Relational Rules
Noisy probabilistic relational rules are a promising world model representation for several reasons. They are compact and generalize over world instantiations. They are usually in...
Tobias Lang, Marc Toussaint
DAGSTUHL
2004
13 years 10 months ago
On the Complexity of Parabolic Initial Value Problems with Variable Drift
We study the intrinsic difficulty of solving linear parabolic initial value problems numerically at a single point. We present a worst case analysis for deterministic as well as fo...
Knut Petras, Klaus Ritter
SODA
2003
ACM
126views Algorithms» more  SODA 2003»
13 years 10 months ago
Smaller core-sets for balls
We prove the existence of small core-sets for solving approximate k-center clustering and related problems. The size of these core-sets is considerably smaller than the previously...
Mihai Badoiu, Kenneth L. Clarkson