1068 search results - page 127 / 214 » Factorization as a Rank 1 Problem |
STOC
1998
ACM
15 years 2 months ago
1998
ACM
We present a deterministic strongly polynomial algorithm that computes the permanent of a nonnegative n × n matrix to within a multiplicative factor of en. To this end we develop...
IPPS
1997
IEEE
15 years 2 months ago
1997
IEEE
We present a parallel priority data structure that improves the running time of certain algorithms for problems that lack a fast and work-efficient parallel solution. As a main a...
PDPTA
2007
14 years 11 months ago
2007
- In this paper we experiment with two optimization techniques we are considering implementing in a parallelizing compiler that generates parallel code for a distributed-memory sys...
ECIR
2004
Springer
14 years 11 months ago
2004
Springer
Content-only retrieval of XML documents deals with the problem of locating the smallest XML elements that satisfy the query. In this paper, we investigate the application of a spec...
WAOA
2010
Springer
14 years 7 months ago
2010
Springer
We study approximation solutions for the densest k-subgraph problem (DS-k) on several classes of intersection graphs. We adopt the concept of -quasi elimination orders, introduced ...