Sciweavers

1814 search results - page 40 / 363
» Improved Results on Geometric Hitting Set Problems
Sort
View
ESA
2001
Springer
132views Algorithms» more  ESA 2001»
14 years 1 months ago
Greedy Algorithms for Minimisation Problems in Random Regular Graphs
In this paper we introduce a general strategy for approximating the solution to minimisation problems in random regular graphs. We describe how the approach can be applied to the m...
Michele Zito
IIS
2003
13 years 10 months ago
Web Search Results Clustering in Polish: Experimental Evaluation of Carrot
Abstract. In this paper we consider the problem of web search results clustering in the Polish language, supporting our analysis with results acquired from an experimental system n...
Dawid Weiss, Jerzy Stefanowski
IWPEC
2010
Springer
13 years 7 months ago
Inclusion/Exclusion Branching for Partial Dominating Set and Set Splitting
Abstract. Inclusion/exclusion branching is a way to branch on requirements imposed on problems, in contrast to the classical branching on parts of the solution. The technique turne...
Jesper Nederlof, Johan M. M. van Rooij
ADC
2003
Springer
128views Database» more  ADC 2003»
14 years 2 months ago
An algorithm for the induction of defeasible logic theories from databases
Defeasible logic is a non-monotonic logic with applications in rule-based domains such as law. To ease the development and improve the accuracy of expert systems based on defeasib...
Benjamin Johnston, Guido Governatori
FOCS
2009
IEEE
14 years 3 months ago
Instance-Optimal Geometric Algorithms
We prove the existence of an algorithm A for computing 2-d or 3-d convex hulls that is optimal for every point set in the following sense: for every set S of n points and for ever...
Peyman Afshani, Jérémy Barbay, Timot...