1006 search results - page 158 / 202 » What is this page known for |
BMCBI
2004
13 years 8 months ago
2004
Background: All known genomes code for a large number of transcription factors. It is important to develop methods that will reveal how these transcription factors act on a genome...
IGPL
2008
13 years 8 months ago
2008
We propose here an extension of Rice's Theorem to first-order logic, proven by totally elementary means. If P is any property defined over the collection of all first-order t...
CRYPTO
2012
Springer
11 years 11 months ago
2012
Springer
A secret-sharing scheme realizes a graph if every two vertices connected by an edge can reconstruct the secret while every independent set in the graph does not get any informatio...
STOC
2002
ACM
14 years 9 months ago
2002
ACM
We present improved algorithms for maintaining transitive closure and all-pairs shortest paths/distances in a digraph under deletion of edges. For the problem of transitive closur...
COMPGEOM
2006
ACM
14 years 2 months ago
2006
ACM
We extend linkage unfolding results from the well-studied case of polygonal linkages to the more general case of linkages of polygons. More precisely, we consider chains of nonove...