1884 search results - page 202 / 377 » Simple Algorithm for Simple Timed Games |
156
click to vote
NIPS
2007
15 years 7 months ago
2007
This paper1 explores the use of a Maximal Average Margin (MAM) optimality principle for the design of learning algorithms. It is shown that the application of this risk minimizati...
169
click to vote
CCCG
1998
15 years 7 months ago
1998
Given a set P of n points in Rd, a fundamental problem in computational geometry is concerned with finding the smallest shape of some type that encloses all the points of P. Well-...
158
click to vote
TREC
1998
15 years 7 months ago
1998
This paper describes the THISL system that participated in the TREC-7 evaluation, Spoken Document Retrieval (SDR) Track, and presents the results obtained, together with some anal...
167
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
We show that the mistake bound for predicting the nodes of an arbitrary weighted graph is characterized (up to logarithmic factors) by the cutsize of a random spanning tree of the...
179
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We consider the problem of constructing bounded-degree planar geometric spanners of Euclidean and unit-disk graphs. It is well known that the Delaunay subgraph is a planar geometri...