2356 search results - page 23 / 472 » Characterizations of postman sets |
151
click to vote
COMBINATORICS
2007
15 years 5 months ago
2007
It is well-known that Sturmian sequences are the non ultimately periodic sequences that are balanced over a 2-letter alphabet. They are also characterized by their complexity: the...
146
click to vote
FUIN
2002
15 years 5 months ago
2002
Time-varying codes associate variable length code words to letters being encoded depending on their positions in the input string. These codes have been introduced in [8] as a pro...
164
click to vote
CRYPTO
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. Non-interactive zero-knowledge (NIZK) proofs have been investigated in two models: the Public Parameter model and the Secret Parameter model. In the former, a public stri...
145
click to vote
DEXA
2004
Springer
15 years 11 months ago
2004
Springer
Much work has been done on characterizing the workload of a database system. Previous studies focused on providing different types of statistical summaries, and modeling the run-ti...
148
click to vote
ESE
1990
15 years 9 months ago
1990
Most approaches to model-based diagnosis describe a diagnosis for a system as a set of failing components that explains the symptoms. In order to characterize the typically very l...