3897 search results - page 198 / 780 » complexity 2010 |
138
click to vote
ENTCS
2002
15 years 4 months ago
2002
Runtime verification permits checking system properties that cannot be fully verified off-line. This is particularly true when the system includes complex third-party components, ...
127
Voted
TOG
2010
14 years 11 months ago
2010
We present a general framework for analyzing the transport matrix of a real-world scene at full resolution, without capturing many photos. The key idea is to use projectors and ca...
135
click to vote
STACS
2010
Springer
16 years 17 hour ago
2010
Springer
We present a method for reducing the treewidth of a graph while preserving all the minimal s−t separators. This technique turns out to be very useful in the design of parameteriz...
146
Voted
ITP
2010
15 years 9 months ago
2010
Abstract. We present a compiler for definitions made by pattern matching on inductive families in the Coq system. It allows to write structured, recursive dependently-typed functi...
173
click to vote
SWAT
2010
Springer
15 years 2 months ago
2010
Springer
As Bin Packing is NP-hard already for k = 2 bins, it is unlikely to be solvable in polynomial time even if the number of bins is a fixed constant. However, if the sizes of the item...