484 search results - page 27 / 97 » The number of convex permutominoes |
103
Voted
ESANN
2001
15 years 2 months ago
2001
We develop improved risk bounds for function estimation with models such as single hidden layer neural nets, using a penalized least squares criterion to select the size of the mod...
117
click to vote
COMPGEOM
2007
ACM
15 years 4 months ago
2007
ACM
We present a data structure for answering approximate shortest path queries in a planar subdivision from a fixed source. Let 1 be a real number. Distances in each face of this sub...
101
Voted
COMPGEOM
2005
ACM
15 years 2 months ago
2005
ACM
We initiate the study of exact geometric algorithms that require limited storage and make only a small number of passes over the input. Fundamental problems such as lowdimensional...
133
Voted
COMPGEOM
2005
ACM
15 years 2 months ago
2005
ACM
Star splaying is a general-dimensional algorithm that takes as input a triangulation or an approximation of a convex hull, and produces the Delaunay triangulation, weighted Delaun...
123
Voted
AAAI
2006
15 years 2 months ago
2006
Partially observable Markov decision processes (POMDPs) are an intuitive and general way to model sequential decision making problems under uncertainty. Unfortunately, even approx...