Sciweavers

1172 search results - page 51 / 235
» Constructions of generalized Sidon sets
Sort
View
COMGEO
2006
ACM
14 years 12 months ago
Compatible triangulations and point partitions by series-triangular graphs
We introduce series-triangular graph embeddings and show how to partition point sets with them. This result is then used to prove an upper bound on the number of Steiner points nee...
Jeff Danciger, Satyan L. Devadoss, Don Sheehy
IV
2008
IEEE
155views Visualization» more  IV 2008»
15 years 6 months ago
Visualise Undrawable Euler Diagrams
Given a group of overlapping sets, it is not always possible to represent it with Euler diagrams. Euler diagram characteristics might collide with the sets relationships to depict...
Paolo Simonetto, David Auber
STOC
2001
ACM
115views Algorithms» more  STOC 2001»
16 years 4 days ago
Running time and program size for self-assembled squares
Recently Rothemund and Winfree 6] have considered the program size complexity of constructing squares by selfassembly. Here, we consider the time complexity of such constructions ...
Leonard M. Adleman, Qi Cheng, Ashish Goel, Ming-De...
EUROCRYPT
2010
Springer
15 years 4 months ago
Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups
We develop an abstract framework that encompasses the key properties of bilinear groups of composite order that are required to construct secure pairing-based cryptosystems, and we...
David Mandell Freeman
BMCBI
2004
207views more  BMCBI 2004»
14 years 11 months ago
Computational identification of transcription factor binding sites by functional analysis of sets of genes sharing overrep-resen
Background: Transcriptional regulation is a key mechanism in the functioning of the cell, and is mostly effected through transcription factors binding to specific recognition moti...
Davide Corà, Ferdinando Di Cunto, Paolo Pro...