4047 search results - page 115 / 810 » Some Properties and Some Problems on Set Functors |
107
click to vote
SIAMDM
2008
15 years 4 months ago
2008
The Windy Postman Problem consists of finding a minimum cost traversal of all the edges of an undirected graph with two costs associated with each edge, representing the costs of ...
130
click to vote
ISAAC
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Set agreement is a fundamental problem in distributed computing in which processes collectively choose a small subset of values from a larger set of proposals. The imposs...
142
click to vote
KDD
2008
ACM
16 years 5 months ago
2008
ACM
Supervised classification methods have been shown to be very effective for a large number of applications. They require a training data set whose instances are labeled to indicate...
126
click to vote
ICONIP
2007
15 years 6 months ago
2007
In this paper we eliminate the need for parameter estimation associated with the set covering machine (SCM) by directly minimizing generalization error bounds. Firstly, we consider...
136
click to vote
COMPGEOM
2010
ACM
15 years 9 months ago
2010
ACM
We study the expected number of interior vertices of degree i in a triangulation of a point set S, drawn uniformly at random from the set of all triangulations of S, and derive va...