Sciweavers

199 search results - page 34 / 40
» Intensional Positive Set Theory
Sort
View
ML
2006
ACM
13 years 7 months ago
Gleaner: Creating ensembles of first-order clauses to improve recall-precision curves
Many domains in the field of Inductive Logic Programming (ILP) involve highly unbalanced data. A common way to measure performance in these domains is to use precision and recall i...
Mark Goadrich, Louis Oliphant, Jude W. Shavlik
SIGIR
2008
ACM
13 years 7 months ago
Intuition-supporting visualization of user's performance based on explicit negative higher-order relevance
Modeling the beyond-topical aspects of relevance are currently gaining popularity in IR evaluation. For example, the discounted cumulated gain (DCG) measure implicitly models some...
Heikki Keskustalo, Kalervo Järvelin, Ari Pirk...
COMGEO
1999
ACM
13 years 7 months ago
Point labeling with sliding labels
This paper discusses algorithms for labeling sets of points in the plane, where labels are not restricted to some finite number of positions. We show that continuously sliding lab...
Marc J. van Kreveld, Tycho Strijk, Alexander Wolff
COMPGEOM
2006
ACM
14 years 1 months ago
Provably good sampling and meshing of Lipschitz surfaces
In the last decade, a great deal of work has been devoted to the elaboration of a sampling theory for smooth surfaces. The goal was to ensure a good reconstruction of a given surf...
Jean-Daniel Boissonnat, Steve Oudot
ICDT
2010
ACM
137views Database» more  ICDT 2010»
13 years 6 months ago
A Greedy Algorithm for Constructing a Low-Width Generalized Hypertree Decomposition
We propose a greedy algorithm which, given a hypergraph H and a positive integer k, produces a hypertree decomposition of width less than or equal to 3k −1, or determines that H...
Kaoru Katayama, Tatsuro Okawara, Yuka Itou