4328 search results - page 128 / 866 » A New Kind of Science |
180
click to vote
WG
2009
Springer
16 years 24 days ago
2009
Springer
We present a fully dynamic algorithm that maintains three different representations of an interval graph: a minimal interval model of the graph, the PQ-tree of its maximal cliques...
162
Voted
DIS
2009
Springer
16 years 24 days ago
2009
Springer
Abstract. We propose a new boosting algorithm based on a linear programming formulation. Our algorithm can take advantage of the sparsity of the solution of the underlying optimiza...
151
click to vote
FOCS
2007
IEEE
16 years 16 days ago
2007
IEEE
In this paper we present a new approximation algorithm for the Max Acyclic Subgraph problem. Given an instance where the maximum acyclic subgraph contains 1/2 + δ fraction of all...
140
click to vote
FOCS
2007
IEEE
16 years 16 days ago
2007
IEEE
We present a new approach to constructing pseudorandom generators that fool lowdegree polynomials over finite fields, based on the Gowers norm. Using this approach, we obtain th...
133
click to vote
GI
2007
Springer
16 years 11 days ago
2007
Springer
Abstract: This paper concentrates on a new framework for a post-market reassignment of requests in a Collaborative Carrier Network (CCN). While the framework was applied to a picku...