Sciweavers

406 search results - page 5 / 82
» Identifying Codes and Covering Problems
Sort
View
COMBINATORICS
2007
86views more  COMBINATORICS 2007»
13 years 8 months ago
Lower Bounds for the Football Pool Problem for 7 and 8 Matches
Let k3(n) denote the minimal cardinality of a ternary code of length n and covering radius one. In this paper we show k3(7) ≥ 156 and k3(8) ≥ 402 improving on the best previou...
Wolfgang Haas
EJC
2008
13 years 8 months ago
Identifying codes of cycles with odd orders
The problem of the r-identifying code of a cycle Cn has been solved totally when n is even. Recently, S. Gravier et al. give the r-identifying code for the cycle Cn with the minim...
Min Xu, Krishnaiyan Thulasiraman, Xiao-Dong Hu
VL
2009
IEEE
156views Visual Languages» more  VL 2009»
14 years 3 months ago
Non-programmers identifying functionality in unfamiliar code: Strategies and barriers
Source code on the web is a widely available and potentially rich learning resource for nonprogrammers. However, unfamiliar code can be daunting to end-users without programming e...
Paul A. Gross, Caitlin Kelleher
ESORICS
2011
Springer
12 years 8 months ago
Who Wrote This Code? Identifying the Authors of Program Binaries
Program authorship attribution—identifying a programmer based on stylistic characteristics of code—has practical implications for detecting software theft, digital forensics, a...
Nathan E. Rosenblum, Xiaojin Zhu, Barton P. Miller
BROADNETS
2007
IEEE
14 years 2 months ago
Joint monitoring and routing in wireless sensor networks using robust identifying codes
Wireless Sensor Networks (WSNs) provide an important means of monitoring the physical world, but their ons present challenges to fundamental network services such as routing. In t...
Moshe Laifenfeld, Ari Trachtenberg, Reuven Cohen, ...