307 search results - page 10 / 62 » A Comparison of Algorithms for Connected Set Openings and Cl... |
ISAAC
2009
Springer
13 years 12 months ago
2009
Springer
For a connected graph G = (V, E), a subset U ⊆ V is called a k-cut if U disconnects G, and the subgraph induced by U contains exactly k (≥ 1) components. More specifically, a ...
ICPR
2006
IEEE
14 years 8 months ago
2006
IEEE
Distance functions are an important component in many learning applications. However, the correct function is context dependent, therefore it is advantageous to learn a distance f...
COMSIS
2006
13 years 7 months ago
2006
In this paper we present an improvement of the precision of classification algorithm results. Two various approaches are known: bagging and boosting. This paper describes a set of ...
WINE
2010
Springer
13 years 5 months ago
2010
Springer
We study Facility Location games, where a number of facilities are placed in a metric space based on locations reported by strategic agents. A mechanism maps the agents' locat...
SODA
2012
ACM
11 years 9 months ago
2012
ACM
We give a constant factor approximation algorithm for the following generalization of the k-median problem. We are given a set of clients and facilities in a metric space. Each fa...