Sciweavers

484 search results - page 53 / 97
» The number of convex permutominoes
Sort
View
DIMACS
2001
13 years 11 months ago
Combinatorial Roadmaps in Configuration Spaces of Simple Planar Polygons
Abstract. One-degree-of-freedom mechanisms induced by minimum pseudotriangulations with one convex hull edge removed have been recently introduced by the author to solve a family o...
Ileana Streinu
AMAI
2006
Springer
13 years 10 months ago
Bargaining over multiple issues in finite horizon alternating-offers protocol
In this paper we study multi issue alternating-offers bargaining in a perfect information finite horizon setting, we determine the pertinent subgame perfect equilibrium, and we pro...
Francesco Di Giunta, Nicola Gatti
JMLR
2006
143views more  JMLR 2006»
13 years 10 months ago
Consistency and Convergence Rates of One-Class SVMs and Related Algorithms
We determine the asymptotic behaviour of the function computed by support vector machines (SVM) and related algorithms that minimize a regularized empirical convex loss function i...
Régis Vert, Jean-Philippe Vert
ICPR
2008
IEEE
14 years 11 months ago
Solving quadratically constrained geometrical problems using lagrangian duality
In this paper we consider the problem of solving different pose and registration problems under rotational constraints. Traditionally, methods such as the iterative closest point ...
Carl Olsson, Anders Eriksson
PODS
2005
ACM
85views Database» more  PODS 2005»
14 years 10 months ago
Relative risk and odds ratio: a data mining perspective
We are often interested to test whether a given cause has a given effect. If we cannot specify the nature of the factors involved, such tests are called model-free studies. There ...
Haiquan Li, Jinyan Li, Limsoon Wong, Mengling Feng...