150 search results - page 24 / 30 » New Bounds for Codes Identifying Vertices in Graphs |
BIRTHDAY
2010
Springer
15 years 23 days ago
2010
Springer
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...
106
click to vote
CCS
2009
ACM
16 years 7 days ago
2009
ACM
Knowledge discovery on social network data can uncover latent social trends and produce valuable findings that benefit the welfare of the general public. A growing amount of resea...
RECOMB
2008
Springer
15 years 12 months ago
2008
Springer
Abstract. In engineering protein variants by constructing and screening combinatorial libraries of chimeric proteins, two complementary and competing goals are desired: the new pro...
ICFP
2003
ACM
15 years 11 months ago
2003
ACM
Program analysis is the heart of modern compilers. Most control flow analyses are reduced to the problem of finding a fixed point in a certain transition system, and such fixed po...
CSFW
2004
IEEE
15 years 3 months ago
2004
IEEE
We present a new static analysis for reviewing the security of libraries for systems, such as JVMs or the CLR, that rely on stack inspection for access control. We describe its im...