Sciweavers

1257 search results - page 90 / 252
» A generalization of Euler's constant
Sort
View
STOC
2010
ACM
193views Algorithms» more  STOC 2010»
14 years 1 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
KR
2010
Springer
14 years 1 months ago
Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth Is not Enough
Cardinality constraints or, more generally, weight constraints are well recognized as an important extension of answer-set programming. Clearly, all common algorithmic tasks relat...
Reinhard Pichler, Stefan Rümmele, Stefan Szei...
MFCS
2001
Springer
14 years 1 months ago
On Pseudorandom Generators in NC
In this paper we consider the question of whether NC0 circuits can generate pseudorandom distributions. While we leave the general question unanswered, we show • Generators compu...
Mary Cryan, Peter Bro Miltersen
CGI
1998
IEEE
14 years 1 months ago
Hierarchical Decomposition of Datasets on Irregular Surface Meshes
In this paper we introduce multiresolution analysis (MRA) algorithmsintendedto be used in scientific visualization,and basedon a non-nestedset ofapproximatingspaces. The need for ...
Georges-Pierre Bonneau, Alexandre Gerussi
COMPGEOM
1998
ACM
14 years 1 months ago
Geometric Applications of a Randomized Optimization Technique
Abstract. We propose a simple, general, randomized technique to reduce certain geometric optimization problems to their corresponding decision problems. These reductions increase t...
Timothy M. Chan