6142 search results - page 977 / 1229 » The Complexity of Partition Functions |
177
click to vote
CONCUR
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We study the decidability and complexity of verification problems for timed automata over time intervals of fixed, bounded length. One of our main results is that time-bo...
183
click to vote
ER
2007
Springer
15 years 10 months ago
2007
Springer
The paper presents an unified Description Logic (DL) model for databases. Describing database models using DLs is a fundamental problem in many areas because it turns databases to...
179
click to vote
ICLP
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. Reasoning about social networks (labeled, directed, weighted graphs) is becoming increasingly important and there are now models of how certain phenomena (e.g. adoption o...
189
click to vote
KDD
2010
ACM
15 years 10 months ago
2010
ACM
In this paper we introduce a modular, highly flexible, opensource environment for data generation. Using an existing graphical data flow tool, the user can combine various types...
149
click to vote
SP
2010
IEEE
15 years 10 months ago
2010
IEEE
Abstract—Unfortunately, malicious software is still an unsolved problem and a major threat on the Internet. An important component in the fight against malicious software is the...