Sciweavers

1242 search results - page 143 / 249
» A Computational Complexity Theory in Membrane Computing
Sort
View
STOC
2010
ACM
245views Algorithms» more  STOC 2010»
15 years 2 months ago
Weighted Geometric Set Cover via Quasi-Uniform Sampling
There has been much progress on geometric set cover problems, but most known techniques only apply to the unweighted setting. For the weighted setting, very few results are known ...
Kasturi Varadarajan
STOC
2010
ACM
193views Algorithms» more  STOC 2010»
15 years 2 months ago
Maintaining a large matching and a small vertex cover
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
Krzysztof Onak, Ronitt Rubinfeld
AISC
2010
Springer
15 years 2 months ago
Symbolic Domain Decomposition
Decomposing the domain of a function into parts has many uses in mathematics. A domain may naturally be a union of pieces, a function may be defined by cases, or different bounda...
Jacques Carette, Alan P. Sexton, Volker Sorge, Ste...
LPAR
2001
Springer
15 years 2 months ago
A Local System for Classical Logic
Abstract. The calculus of structures is a framework for specifying logical systems, which is similar to the one-sided sequent calculus but more general. We present a system of infe...
Kai Brünnler, Alwen Fernanto Tiu
DATE
2004
IEEE
134views Hardware» more  DATE 2004»
15 years 1 months ago
Context-Aware Performance Analysis for Efficient Embedded System Design
Performance analysis has many advantages in theory compared to simulation for the validation of complex embedded systems, but is rarely used in practice. To make analysis more att...
Marek Jersak, Rafik Henia, Rolf Ernst