870 search results - page 13 / 174 » Constructions for Difference Triangle Sets |
79
Voted
EJC
2010
15 years 13 days ago
2010
The paper contains a construction of a universal countable graph, different from the Rado graph, such that for any of its vertices both the neighbourhood and the non-neighbourhood ...
118
click to vote
SDM
2003
SIAM
15 years 1 months ago
2003
SIAM
The problem of finding clusters in data is challenging when clusters are of widely differing sizes, densities and shapes, and when the data contains large amounts of noise and out...
109
Voted
SI3D
2009
ACM
15 years 7 months ago
2009
ACM
Given a data layout of a large walkthrough scene, we present a novel and simple spatial hierarchy on the disk-pages of the layout that has notable advantages over a conventional s...
118
click to vote
CORR
1999
Springer
15 years 20 hour ago
1999
Springer
A hinged dissection of a set of polygons S is a collection of polygonal pieces hinged together at vertices that can be rotated into any member of S. We present a hinged dissection...
100
Voted
BMCBI
2008
15 years 14 days ago
2008
Background: In this paper, it is proposed an optimization approach for producing reduced alphabets for peptide classification, using a Genetic Algorithm. The classification task i...