9997 search results - page 390 / 2000 » The case for crowd computing |
149
Voted
COMGEO
2008
ACM
15 years 6 months ago
2008
ACM
Given a set of points P Rd and value > 0, an -core-set S P has the property that the smallest ball containing S is within of the smallest ball containing P. This paper shows ...
167
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
In this paper we study the computation of the Nash bargaining solution for the two players, K frequency bands case, under joint FDM/TDM spectrum allocations and total power constra...
185
click to vote
CG
2010
Springer
15 years 4 months ago
2010
Springer
Monte-Carlo Tree Search (MCTS) is a successful algorithm used in many state of the art game engines. We propose to improve a MCTS solver when a game has more than two outcomes. It ...
188
click to vote
ICPR
2010
IEEE
15 years 4 months ago
2010
IEEE
This paper deals with the construction of a non parametric multiscale analysis from a 1D parametric decomposition of shapes where the elements of the decomposition are geometric p...
323
click to vote
ICANN
2011
Springer
14 years 10 months ago
2011
Springer
The definition of appropriate kernel functions is crucial for the performance of a kernel method. In many of the state-of-the-art kernels for trees, matching substructures are con...