10 search results - page 1 / 2 » There are not too many magic configurations |
COMPGEOM
2007
ACM
13 years 11 months ago
2007
ACM
A finite planar point set P is called a magic configuration if there is an assignment of positive weights to the points of P such that, for every line l determined by P, the sum o...
KDD
2001
ACM
14 years 7 months ago
2001
ACM
CoIL challenge 2000 was a supervised learning contest that attracted 43 entries. The authors of 29 entries later wrote explanations of their work. This paper discusses these repor...
FPL
2008
Springer
13 years 9 months ago
2008
Springer
While there have been many reported implementations of Networks-on-Chip (NoCs) on FPGAs, they have not seen the same acceptance as NoCs on ASICs. One reason is that communication ...
4OR
2005
13 years 7 months ago
2005
Many real problems can be modelled as robust shortest path problems on digraphs with interval costs, where intervals represent uncertainty about real costs and a robust path is not...
ECCV
2008
Springer
14 years 9 months ago
2008
Springer
Abstract. We present a closed-form solution to the problem of recovering the 3D shape of a non-rigid inelastic surface from 3D-to-2D correspondences. This lets us detect and recons...