Sciweavers

1760 search results - page 23 / 352
» Connected Set Cover Problem and Its Applications
Sort
View
FOSSACS
2009
Springer
14 years 2 months ago
Facets of Synthesis: Revisiting Church's Problem
In this essay we discuss the origin, central results, and some perspectives of algorithmic synthesis of nonterminating reactive programs. We recall the fundamental questions raised...
Wolfgang Thomas
SP
2008
IEEE
159views Security Privacy» more  SP 2008»
13 years 7 months ago
Inferring neuronal network connectivity from spike data: A temporal data mining approach
Abstract. Understanding the functioning of a neural system in terms of its underlying circuitry is an important problem in neuroscience. Recent developments in electrophysiology an...
Debprakash Patnaik, P. S. Sastry, K. P. Unnikrishn...
ESOP
2008
Springer
13 years 9 months ago
Cover Algorithms and Their Combination
This paper defines the cover of a formula with respect to a set of variables V in theory T to be the strongest quantifier-free formula that is implied by V : in theory T. Cover e...
Sumit Gulwani, Madan Musuvathi
DGCI
2008
Springer
13 years 9 months ago
A New Fuzzy Connectivity Class Application to Structural Recognition in Images
Fuzzy sets theory constitutes a poweful tool, that can lead to more robustness in problems such as image segmentation and recognition. This robustness results to some extent from t...
Olivier Nempont, Jamal Atif, Enrico Angelini, Isab...
APPROX
2004
Springer
122views Algorithms» more  APPROX 2004»
14 years 1 months ago
Maximum Coverage Problem with Group Budget Constraints and Applications
We study a variant of the maximum coverage problem which we label the maximum coverage problem with group budget constraints (MCG). We are given a collection of sets S = {S1, S2, ....
Chandra Chekuri, Amit Kumar