Sciweavers

77 search results - page 6 / 16
» Explicit constructions of RIP matrices and related problems
Sort
View
EWNLG
1993
15 years 2 months ago
Choosing a Set of Coherence Relations for Text Generation: A Data-Driven Approach
Abstract. An active research programme in Natural Language Generation has grown up around the notion of `coherence relations'. Relations are being used in a variety of roles i...
Alistair Knott, Robert Dale
ICPR
2006
IEEE
15 years 11 months ago
A Minimum Sphere Covering Approach to Pattern Classification
In this paper we present a minimum sphere covering approach to pattern classification that seeks to construct a minimum number of spheres to represent the training data and formul...
Jigang Wang, Predrag Neskovic, Leon N. Cooper
STACS
2005
Springer
15 years 3 months ago
Sampling Sub-problems of Heterogeneous Max-cut Problems and Approximation Algorithms
Abstract Abstract. Recent work in the analysis of randomized approximation algorithms for NP-hard optimization problems has involved approximating the solution to a problem by the ...
Petros Drineas, Ravi Kannan, Michael W. Mahoney
STOC
2005
ACM
147views Algorithms» more  STOC 2005»
15 years 10 months ago
Simulating independence: new constructions of condensers, ramsey graphs, dispersers, and extractors
We present new explicit constructions of deterministic randomness extractors, dispersers and related objects. We say that a distribution X on binary strings of length n is a -sour...
Boaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sud...
IJFCS
2006
70views more  IJFCS 2006»
14 years 10 months ago
The Computational Complexity of Avoiding Forbidden Submatrices by Row Deletions
We initiate a systematic study of the Row Deletion(B) problem on matrices: Given an input matrix A and a fixed "forbidden submatrix" B, the task is to remove a minimum n...
Sebastian Wernicke, Jochen Alber, Jens Gramm, Jion...