Concept learning with geometric hypotheses
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
Maximizing Agreement with a Classification by Bounded or Unbounded Number of Associated Words
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
On the difficulty of approximately maximizing agreements
Journal of Computer and System Sciences
Computational Geometry: Theory and Applications - Special issue on computational geometry - EWCG'02
Bichromatic separability with two boxes: A general approach
Journal of Algorithms
On burstiness-aware search for document sequences
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Identifying, attributing and describing spatial bursts
Proceedings of the VLDB Endowment
The mono- and bichromatic empty rectangle and square problems in all dimensions
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Approximation algorithms for minimizing empirical error by axis-parallel hyperplanes
ECML'05 Proceedings of the 16th European conference on Machine Learning
An Improved Branch-and-Bound Method for Maximum Monomial Agreement
INFORMS Journal on Computing
Operations Research Letters
On the spatiotemporal burstiness of terms
Proceedings of the VLDB Endowment
On the coarseness of bicolored point sets
Computational Geometry: Theory and Applications
STEM: a spatio-temporal miner for bursty activity
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
| Hi-index | 0.00 |