171 search results - page 6 / 35 » What's Decidable about Sequences |
DISOPT
2007
13 years 7 months ago
2007
We investigate the computational complexity of a combinatorial problem that arises in DNA sequencing by hybridization: The input consists of an integer together with a set S of wo...
CIKM
2007
Springer
14 years 1 months ago
2007
Springer
We investigate the subtle cues to user identity that may be exploited in attacks on the privacy of users in web search query logs. We study the application of simple classifiers ...
SADFE
2010
IEEE
13 years 5 months ago
2010
IEEE
: Like other latent evidence that cannot be directly perceived by people, bit sequences have to be presented through tools. Presentations of digital forensic evidence often involve...
AIM
2005
13 years 7 months ago
2005
If it is true that good problems produce good science, then it will be worthwhile to identify good problems, and even more worthwhile to discover the attributes that make them goo...
AAAI
1998
13 years 8 months ago
1998
People frequently complain that it is too difficult to figure out how to get computers to do what they want. However, with a computer system that actually tries to understand what...