Sciweavers

2738 search results - page 95 / 548
» The Frobenius Problem and Its Generalizations
Sort
View
PODS
2008
ACM
123views Database» more  PODS 2008»
15 years 10 months ago
Evaluating rank joins with optimal cost
In the rank join problem, we are given a set of relations and a scoring function, and the goal is to return the join results with the top K scores. It is often the case in practic...
Karl Schnaitter, Neoklis Polyzotis
COMPGEOM
1995
ACM
15 years 1 months ago
On Conway's Thrackle Conjecture
A thrackle is a graph drawn in the plane so that its edges are represented by Jordan arcs and any two distinct arcs either meet at exactly one common vertex or cross at exactly on...
László Lovász, János P...
CVPR
2007
IEEE
15 years 12 months ago
Fast, Approximately Optimal Solutions for Single and Dynamic MRFs
A new efficient MRF optimization algorithm, called FastPD, is proposed, which generalizes -expansion. One of its main advantages is that it offers a substantial speedup over that ...
Nikos Komodakis, Georgios Tziritas, Nikos Paragios
ISI
2008
Springer
14 years 9 months ago
A framework for privacy-preserving cluster analysis
Abstract--Releasing person-specific data could potentially reveal sensitive information of individuals. k-anonymization is a promising privacy protection mechanism in data publishi...
Benjamin C. M. Fung, Ke Wang, Lingyu Wang, Mourad ...
ALT
2002
Springer
15 years 6 months ago
A Pathology of Bottom-Up Hill-Climbing in Inductive Rule Learning
In this paper, we close the gap between the simple and straight-forward implementations of top-down hill-climbing that can be found in the literature, and the rather complex strate...
Johannes Fürnkranz