614 search results - page 51 / 123 » DE in Slovenia: Where are We |
ATVA
2009
Springer
14 years 2 months ago
2009
Springer
: In this paper, we address the problem of synthesizing opaque systems. A secret predicate S over the runs of a system G is opaque to an external user having partial observability ...
LPAR
2001
Springer
14 years 5 days ago
2001
Springer
When it comes to building robot controllers, highlevel programming arises as a feasible alternative to planning. The task then is to verify a high-level program by finding a lega...
BMCBI
2011
13 years 2 months ago
2011
Background: Next-generation sequencing technologies have led to the high-throughput production of sequence data (reads) at low cost. However, these reads are significantly shorter...
COMGEO
2010
ACM
13 years 7 months ago
2010
ACM
We study the complexity and the I/O-efficient computation of flow on triangulated terrains. We present an acyclic graph, the descent graph, that enables us to trace flow paths in ...
ISAAC
2004
Springer
14 years 1 months ago
2004
Springer
We study complexity and approximation of min weighted node coloring in planar, bipartite and split graphs. We show that this problem is NP-complete in planar graphs, even if they a...