Sciweavers

237 search results - page 30 / 48
» MapReduce for Integer Factorization
Sort
View
105
Voted
DAC
1999
ACM
15 years 4 months ago
Exact Memory Size Estimation for Array Computations without Loop Unrolling
This paper presents a new algorithm for exact estimation of the minimum memory size required by programs dealing with array computations. Memory size is an important factor a ecti...
Ying Zhao, Sharad Malik
86
Voted
APPROX
2008
Springer
100views Algorithms» more  APPROX 2008»
15 years 2 months ago
A Simple LP Relaxation for the Asymmetric Traveling Salesman Problem
A long-standing conjecture in Combinatorial Optimization is that the integrality gap of the Held-Karp LP relaxation for the Asymmetric Traveling Salesman Problem (ATSP) is a consta...
Thành Nguyen
110
Voted
TCS
2008
15 years 10 days ago
Smooth words on 2-letter alphabets having same parity
In this paper, we consider smooth words over 2-letter alphabets {a, b}, where a, b are integers having same parity, with 0 < a < b. We show that all are recurrent and that t...
Srecko Brlek, Damien Jamet, Geneviève Paqui...
87
Voted
JGT
2007
99views more  JGT 2007»
15 years 10 days ago
Backbone colorings for graphs: Tree and path backbones
We introduce and study backbone colorings, a variation on classical vertex colorings: Given a graph G = (V, E) and a spanning subgraph H of G (the backbone of G), a backbone color...
Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, G...
91
Voted
CORR
2011
Springer
186views Education» more  CORR 2011»
14 years 7 months ago
On the Complexity of Solving a Bivariate Polynomial System
We study the complexity of computing the real solutions of a bivariate polynomial system using the recently proposed algorithm Bisolve [3]. Bisolve is a classical elimination metho...
Pavel Emeliyanenko, Michael Sagraloff