Sciweavers

484 search results - page 47 / 97
» The number of convex permutominoes
Sort
View
115
Voted
IVC
2002
112views more  IVC 2002»
15 years 13 days ago
Using distance transforms to decompose 3D discrete objects
Object decomposition into simpler parts greatly diminishes the complexity of a recognition task. In this paper, we present a method to decompose a 3D discrete object into nearly c...
Stina Svensson, Gabriella Sanniti di Baja
DAM
1999
88views more  DAM 1999»
15 years 13 days ago
Separable Partitions
An ordered partition of a set of n points in the d dimensional Euclidean space is called a separable partition if the convex hulls of the parts are pairwise disjoint. For each fix...
Noga Alon, Shmuel Onn
121
Voted
CDC
2009
IEEE
285views Control Systems» more  CDC 2009»
14 years 10 months ago
Adaptive randomized algorithm for finding eigenvector of stochastic matrix with application to PageRank
Abstract-- The problem of finding the eigenvector corresponding to the largest eigenvalue of a stochastic matrix has numerous applications in ranking search results, multi-agent co...
Alexander V. Nazin, Boris T. Polyak
128
Voted
ICANN
2009
Springer
14 years 10 months ago
MINLIP: Efficient Learning of Transformation Models
Abstract. This paper studies a risk minimization approach to estimate a transformation model from noisy observations. It is argued that transformation models are a natural candidat...
Vanya Van Belle, Kristiaan Pelckmans, Johan A. K. ...
112
Voted
CORR
2010
Springer
168views Education» more  CORR 2010»
14 years 10 months ago
Bounds on the maximum multiplicity of some common geometric graphs
We obtain new lower and upper bounds for the maximum multiplicity of some weighted and, respectively, non-weighted common geometric graphs drawn on n points in the plane in genera...
Adrian Dumitrescu, André Schulz, Adam Sheff...