Sciweavers

1814 search results - page 4 / 363
» Improved Results on Geometric Hitting Set Problems
Sort
View
ESA
2004
Springer
120views Algorithms» more  ESA 2004»
14 years 1 months ago
Solving Geometric Covering Problems by Data Reduction
We consider a scenario where stops are to be placed along an already existing public transportation network in order to improve its attractiveness for the customers. The core probl...
Steffen Mecke, Dorothea Wagner
TFS
2008
190views more  TFS 2008»
13 years 7 months ago
A Fast Geometric Method for Defuzzification of Type-2 Fuzzy Sets
Generalised type-2 fuzzy logic systems can not currently be used for practical problems because the amount of computation required to defuzzify a generalised type-2 fuzzy set is to...
Simon Coupland, Robert John
SODA
2012
ACM
243views Algorithms» more  SODA 2012»
11 years 10 months ago
Bidimensionality and geometric graphs
Bidimensionality theory was introduced by Demaine et al. [JACM 2005 ] as a framework to obtain algorithmic results for hard problems on minor closed graph classes. The theory has ...
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh
JMLR
2008
100views more  JMLR 2008»
13 years 7 months ago
Hit Miss Networks with Applications to Instance Selection
In supervised learning, a training set consisting of labeled instances is used by a learning algorithm for generating a model (classifier) that is subsequently employed for decidi...
Elena Marchiori
CIAC
2006
Springer
111views Algorithms» more  CIAC 2006»
13 years 11 months ago
Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments
Complementing recent progress on classical complexity and polynomial-time approximability of feedback set problems in (bipartite) tournaments, we extend and partially improve fixed...
Michael Dom, Jiong Guo, Falk Hüffner, Rolf Ni...