Sciweavers

7648 search results - page 1046 / 1530
» A Data Locality Optimizing Algorithm
Sort
View
158
Voted
WADS
1995
Springer
107views Algorithms» more  WADS 1995»
15 years 9 months ago
Quadrangulations of Planar Sets
We consider the problem of obtaining “nice” quadrangulations of planar sets of points. For many applications “nice” means that the quadrilaterals obtained are convex if po...
Godfried T. Toussaint
AMW
2010
15 years 7 months ago
Query Rewriting under Non-Guarded Rules
We address the problem of answering conjunctive queries over knowledge bases, specified by sets of first-order sentences called tuple-generating dependencies (TGDs). This problem i...
Andrea Calì, Georg Gottlob, Andreas Pieris
163
Voted
IJAR
2006
89views more  IJAR 2006»
15 years 6 months ago
Learning probabilistic decision graphs
Probabilistic decision graphs (PDGs) are a representation language for probability distributions based on binary decision diagrams. PDGs can encode (context-specific) independence...
Manfred Jaeger, Jens D. Nielsen, Tomi Silander
IANDC
2011
84views more  IANDC 2011»
15 years 1 months ago
Teaching randomized learners with feedback
The present paper introduces a new model for teaching randomized learners. Our new model, though based on the classical teaching dimension model, allows to study the influence of...
Frank J. Balbach, Thomas Zeugmann
IJIT
2004
15 years 7 months ago
On the Noise Distance in Robust Fuzzy C-Means
In the last decades, a number of robust fuzzy clustering algorithms have been proposed to partition data sets affected by noise and outliers. Robust fuzzy C-means (robust-FCM) is c...
Mario G. C. A. Cimino, Graziano Frosini, Beatrice ...
« Prev « First page 1046 / 1530 Last » Next »