Sciweavers

8728 search results - page 50 / 1746
» On Reduct Construction Algorithms
Sort
View
FOCS
2003
IEEE
14 years 2 months ago
Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs
A directed multigraph is said to be d-regular if the indegree and outdegree of every vertex is exactly d. By Hall’s theorem one can represent such a multigraph as a combination ...
Haim Kaplan, Moshe Lewenstein, Nira Shafrir, Maxim...
CORR
2006
Springer
110views Education» more  CORR 2006»
13 years 9 months ago
Definitions by Rewriting in the Calculus of Constructions
Abstract : The main novelty of this paper is to consider an extension of the Calculus of Constructions where predicates can be defined with a general form of rewrite rules. We prov...
Frédéric Blanqui
STOC
2007
ACM
94views Algorithms» more  STOC 2007»
14 years 9 months ago
Sampling-based dimension reduction for subspace approximation
We give a randomized bi-criteria algorithm for the problem of finding a k-dimensional subspace that minimizes the Lp-error for given points, i.e., p-th root of the sum of p-th
Amit Deshpande, Kasturi R. Varadarajan
PPOPP
1997
ACM
14 years 1 months ago
The Interaction of Parallel Programming Constructs and Coherence Protocols
Some of the most common parallel programming idioms include locks, barriers, and reduction operations. The interaction of these programming idioms with the multiprocessor's c...
Ricardo Bianchini, Enrique V. Carrera, Leonidas I....
TACAS
2010
Springer
153views Algorithms» more  TACAS 2010»
14 years 3 months ago
Simplifying Linearizability Proofs with Reduction and Abstraction
Tayfun Elmas, Shaz Qadeer, Ali Sezgin, Omer Subasi...