id stringlengths 9 16 | submitter stringlengths 4 52 ⌀ | authors stringlengths 4 937 | title stringlengths 7 243 | comments stringlengths 1 472 ⌀ | journal-ref stringlengths 4 244 ⌀ | doi stringlengths 14 55 ⌀ | report-no nulllengths 3 125 ⌀ | categories stringlengths 5 97 | license stringclasses 9
values | abstract stringlengths 33 2.95k | versions list | update_date timestamp[us] | authors_parsed sequence |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
0704.0062 | Tom\'a\v{s} Vina\v{r} | Rastislav \v{S}r\'amek, Bro\v{n}a Brejov\'a, Tom\'a\v{s} Vina\v{r} | On-line Viterbi Algorithm and Its Relationship to Random Walks | null | Algorithms in Bioinformatics: 7th International Workshop (WABI),
4645 volume of Lecture Notes in Computer Science, pp. 240-251, Philadelphia,
PA, USA, September 2007. Springer | 10.1007/978-3-540-74126-8_23 | null | cs.DS | null | In this paper, we introduce the on-line Viterbi algorithm for decoding hidden
Markov models (HMMs) in much smaller than linear space. Our analysis on
two-state HMMs suggests that the expected maximum memory used to decode
sequence of length $n$ with $m$-state HMM can be as low as $\Theta(m\log n)$,
without a signific... | [
{
"version": "v1",
"created": "Sat, 31 Mar 2007 23:52:33 GMT"
}
] | 2010-01-25T00:00:00 | [
[
"Šrámek",
"Rastislav",
""
],
[
"Brejová",
"Broňa",
""
],
[
"Vinař",
"Tomáš",
""
]
] |
0704.0468 | Jinsong Tan | Jinsong Tan | Inapproximability of Maximum Weighted Edge Biclique and Its Applications | null | LNCS 4978, TAMC 2008, pp 282-293 | null | null | cs.CC cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Given a bipartite graph $G = (V_1,V_2,E)$ where edges take on {\it both}
positive and negative weights from set $\mathcal{S}$, the {\it maximum weighted
edge biclique} problem, or $\mathcal{S}$-MWEB for short, asks to find a
bipartite subgraph whose sum of edge weights is maximized. This problem has
various applicati... | [
{
"version": "v1",
"created": "Tue, 3 Apr 2007 21:39:11 GMT"
},
{
"version": "v2",
"created": "Mon, 23 Mar 2009 02:50:29 GMT"
}
] | 2009-03-23T00:00:00 | [
[
"Tan",
"Jinsong",
""
]
] |
0704.0788 | Kerry Soileau | Kerry M. Soileau | Optimal Synthesis of Multiple Algorithms | null | null | null | null | cs.DS cs.PF | null | In this paper we give a definition of "algorithm," "finite algorithm,"
"equivalent algorithms," and what it means for a single algorithm to dominate a
set of algorithms. We define a derived algorithm which may have a smaller mean
execution time than any of its component algorithms. We give an explicit
expression for ... | [
{
"version": "v1",
"created": "Thu, 5 Apr 2007 19:47:54 GMT"
}
] | 2007-05-23T00:00:00 | [
[
"Soileau",
"Kerry M.",
""
]
] |
0704.0834 | Anatoly Rodionov | Anatoly Rodionov, Sergey Volkov | P-adic arithmetic coding | 29 pages | null | null | null | cs.DS | null | A new incremental algorithm for data compression is presented. For a sequence
of input symbols algorithm incrementally constructs a p-adic integer number as
an output. Decoding process starts with less significant part of a p-adic
integer and incrementally reconstructs a sequence of input symbols. Algorithm
is based ... | [
{
"version": "v1",
"created": "Fri, 6 Apr 2007 02:30:42 GMT"
}
] | 2007-05-23T00:00:00 | [
[
"Rodionov",
"Anatoly",
""
],
[
"Volkov",
"Sergey",
""
]
] |
0704.1068 | Leo Liberti | Giacomo Nannicini, Philippe Baptiste, Gilles Barbier, Daniel Krob, Leo
Liberti | Fast paths in large-scale dynamic road networks | 12 pages, 4 figures | null | null | null | cs.NI cs.DS | null | Efficiently computing fast paths in large scale dynamic road networks (where
dynamic traffic information is known over a part of the network) is a practical
problem faced by several traffic information service providers who wish to
offer a realistic fast path computation to GPS terminal enabled vehicles. The
heuristi... | [
{
"version": "v1",
"created": "Mon, 9 Apr 2007 07:04:19 GMT"
},
{
"version": "v2",
"created": "Wed, 27 Jun 2007 18:17:35 GMT"
}
] | 2007-06-27T00:00:00 | [
[
"Nannicini",
"Giacomo",
""
],
[
"Baptiste",
"Philippe",
""
],
[
"Barbier",
"Gilles",
""
],
[
"Krob",
"Daniel",
""
],
[
"Liberti",
"Leo",
""
]
] |
0704.1748 | Frank Schweitzer | Markus M. Geipel | Self-Organization applied to Dynamic Network Layout | Text revision and figures improved in v.2. See http://www.sg.ethz.ch
for more info and examples | International Journal of Modern Physics C vol. 18, no. 10 (2007),
pp. 1537-1549 | 10.1142/S0129183107011558 | null | physics.comp-ph cs.DS nlin.AO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | As networks and their structure have become a major field of research, a
strong demand for network visualization has emerged. We address this challenge
by formalizing the well established spring layout in terms of dynamic
equations. We thus open up the design space for new algorithms. Drawing from
the knowledge of sy... | [
{
"version": "v1",
"created": "Fri, 13 Apr 2007 16:45:28 GMT"
},
{
"version": "v2",
"created": "Thu, 19 Apr 2007 13:21:55 GMT"
},
{
"version": "v3",
"created": "Sun, 7 Sep 2008 12:46:19 GMT"
},
{
"version": "v4",
"created": "Mon, 24 Nov 2008 18:35:59 GMT"
},
{
"ve... | 2009-11-13T00:00:00 | [
[
"Geipel",
"Markus M.",
""
]
] |
0704.2092 | Jinsong Tan | Jinsong Tan | A Note on the Inapproximability of Correlation Clustering | null | Information Processing Letters, 108: 331-335, 2008 | null | null | cs.LG cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider inapproximability of the correlation clustering problem defined
as follows: Given a graph $G = (V,E)$ where each edge is labeled either "+"
(similar) or "-" (dissimilar), correlation clustering seeks to partition the
vertices into clusters so that the number of pairs correctly (resp.
incorrectly) classifi... | [
{
"version": "v1",
"created": "Tue, 17 Apr 2007 03:52:41 GMT"
},
{
"version": "v2",
"created": "Mon, 23 Mar 2009 03:22:02 GMT"
}
] | 2009-03-23T00:00:00 | [
[
"Tan",
"Jinsong",
""
]
] |
0704.2919 | David Eppstein | David Eppstein, Jean-Claude Falmagne, and Hasan Uzun | On Verifying and Engineering the Well-gradedness of a Union-closed
Family | 15 pages | J. Mathematical Psychology 53(1):34-39, 2009 | 10.1016/j.jmp.2008.09.002 | null | math.CO cs.DM cs.DS | null | Current techniques for generating a knowledge space, such as QUERY,
guarantees that the resulting structure is closed under union, but not that it
satisfies wellgradedness, which is one of the defining conditions for a
learning space. We give necessary and sufficient conditions on the base of a
union-closed set famil... | [
{
"version": "v1",
"created": "Mon, 23 Apr 2007 04:37:08 GMT"
},
{
"version": "v2",
"created": "Fri, 16 Nov 2007 06:56:35 GMT"
},
{
"version": "v3",
"created": "Mon, 14 Apr 2008 00:23:39 GMT"
}
] | 2009-08-28T00:00:00 | [
[
"Eppstein",
"David",
""
],
[
"Falmagne",
"Jean-Claude",
""
],
[
"Uzun",
"Hasan",
""
]
] |
0704.3313 | David Eppstein | David Eppstein and Michael T. Goodrich | Straggler Identification in Round-Trip Data Streams via Newton's
Identities and Invertible Bloom Filters | Fuller version of paper appearing in 10th Worksh. Algorithms and Data
Structures, Halifax, Nova Scotia, 2007 | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We introduce the straggler identification problem, in which an algorithm must
determine the identities of the remaining members of a set after it has had a
large number of insertion and deletion operations performed on it, and now has
relatively few remaining members. The goal is to do this in o(n) space, where n
is ... | [
{
"version": "v1",
"created": "Wed, 25 Apr 2007 06:59:43 GMT"
},
{
"version": "v2",
"created": "Fri, 18 May 2007 21:56:45 GMT"
},
{
"version": "v3",
"created": "Thu, 10 Sep 2009 04:13:31 GMT"
}
] | 2009-09-10T00:00:00 | [
[
"Eppstein",
"David",
""
],
[
"Goodrich",
"Michael T.",
""
]
] |
0704.3496 | Frank Gurski | Frank Gurski | Polynomial algorithms for protein similarity search for restricted mRNA
structures | 10 Pages | null | null | null | cs.DS cs.CC | null | In this paper we consider the problem of computing an mRNA sequence of
maximal similarity for a given mRNA of secondary structure constraints,
introduced by Backofen et al. in [BNS02] denoted as the MRSO problem. The
problem is known to be NP-complete for planar associated implied structure
graphs of vertex degree at... | [
{
"version": "v1",
"created": "Thu, 26 Apr 2007 08:30:14 GMT"
}
] | 2007-05-23T00:00:00 | [
[
"Gurski",
"Frank",
""
]
] |
0704.3773 | Sam Tannous | Sam Tannous | Avoiding Rotated Bitboards with Direct Lookup | 7 pages, 1 figure, 4 listings; replaced test positions, fixed typos | ICGA Journal, Vol. 30, No. 2, pp. 85-91. (June 2007). | null | null | cs.DS | null | This paper describes an approach for obtaining direct access to the attacked
squares of sliding pieces without resorting to rotated bitboards. The technique
involves creating four hash tables using the built in hash arrays from an
interpreted, high level language. The rank, file, and diagonal occupancy are
first isol... | [
{
"version": "v1",
"created": "Sat, 28 Apr 2007 03:11:59 GMT"
},
{
"version": "v2",
"created": "Mon, 23 Jul 2007 19:23:39 GMT"
}
] | 2007-10-09T00:00:00 | [
[
"Tannous",
"Sam",
""
]
] |
0704.3835 | K. Y. Michael Wong | K. Y. Michael Wong and David Saad | Minimizing Unsatisfaction in Colourful Neighbourhoods | 28 pages, 12 figures, substantially revised with additional
explanation | J. Phys. A: Math. Theor. 41, 324023 (2008). | 10.1088/1751-8113/41/32/324023 | null | cs.DS cond-mat.dis-nn cs.CC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Colouring sparse graphs under various restrictions is a theoretical problem
of significant practical relevance. Here we consider the problem of maximizing
the number of different colours available at the nodes and their
neighbourhoods, given a predetermined number of colours. In the analytical
framework of a tree app... | [
{
"version": "v1",
"created": "Sun, 29 Apr 2007 10:03:00 GMT"
},
{
"version": "v2",
"created": "Fri, 21 Dec 2007 04:18:58 GMT"
},
{
"version": "v3",
"created": "Tue, 1 Jul 2008 17:43:32 GMT"
}
] | 2009-11-13T00:00:00 | [
[
"Wong",
"K. Y. Michael",
""
],
[
"Saad",
"David",
""
]
] |
0704.3904 | Fabien Mathieu | Anh-Tuan Gai (INRIA Rocquencourt), Dmitry Lebedev (FT R&D), Fabien
Mathieu (FT R&D), Fabien De Montgolfier (LIAFA), Julien Reynier (LIENS),
Laurent Viennot (INRIA Rocquencourt) | Acyclic Preference Systems in P2P Networks | null | null | null | null | cs.DS cs.GT | null | In this work we study preference systems natural for the Peer-to-Peer
paradigm. Most of them fall in three categories: global, symmetric and
complementary. All these systems share an acyclicity property. As a
consequence, they admit a stable (or Pareto efficient) configuration, where no
participant can collaborate wi... | [
{
"version": "v1",
"created": "Mon, 30 Apr 2007 09:26:39 GMT"
},
{
"version": "v2",
"created": "Wed, 2 May 2007 13:07:31 GMT"
}
] | 2007-05-23T00:00:00 | [
[
"Gai",
"Anh-Tuan",
"",
"INRIA Rocquencourt"
],
[
"Lebedev",
"Dmitry",
"",
"FT R&D"
],
[
"Mathieu",
"Fabien",
"",
"FT R&D"
],
[
"De Montgolfier",
"Fabien",
"",
"LIAFA"
],
[
"Reynier",
"Julien",
"",
"LIENS"
],
[
... |
0705.0204 | Tshilidzi Marwala | Lukasz A. Machowski, and Tshilidzi Marwala | Using Images to create a Hierarchical Grid Spatial Index | In Proceedings of the IEEE International Conference on Systems, Man
and Cybernetics, Taiwan, 2006, pp. 1974-1979 | null | 10.1109/ICSMC.2006.385020 | null | cs.DS | null | This paper presents a hybrid approach to spatial indexing of two dimensional
data. It sheds new light on the age old problem by thinking of the traditional
algorithms as working with images. Inspiration is drawn from an analogous
situation that is found in machine and human vision. Image processing
techniques are use... | [
{
"version": "v1",
"created": "Wed, 2 May 2007 05:37:32 GMT"
}
] | 2016-11-17T00:00:00 | [
[
"Machowski",
"Lukasz A.",
""
],
[
"Marwala",
"Tshilidzi",
""
]
] |
0705.0253 | Jian Li | Mordecai Golin and Li Jian | More Efficient Algorithms and Analyses for Unequal Letter Cost
Prefix-Free Coding | 29 pages;9 figures; | null | null | null | cs.IT cs.DS math.IT | null | There is a large literature devoted to the problem of finding an optimal
(min-cost) prefix-free code with an unequal letter-cost encoding alphabet of
size. While there is no known polynomial time algorithm for solving it
optimally there are many good heuristics that all provide additive errors to
optimal. The additiv... | [
{
"version": "v1",
"created": "Wed, 2 May 2007 11:23:52 GMT"
},
{
"version": "v2",
"created": "Thu, 3 May 2007 09:00:23 GMT"
}
] | 2007-07-13T00:00:00 | [
[
"Golin",
"Mordecai",
""
],
[
"Jian",
"Li",
""
]
] |
0705.0413 | David Eppstein | David Eppstein, Marc van Kreveld, Elena Mumford, and Bettina Speckmann | Edges and Switches, Tunnels and Bridges | 15 pages, 11 figures. To appear in 10th Worksh. Algorithms and Data
Structures, Halifax, Nova Scotia, 2007. This version includes three pages of
appendices that will not be included in the conference proceedings version | Computational Geometry Theory & Applications 42(8): 790-802, 2009 | 10.1016/j.comgeo.2008.05.005 | null | cs.DS cs.CG | null | Edge casing is a well-known method to improve the readability of drawings of
non-planar graphs. A cased drawing orders the edges of each edge crossing and
interrupts the lower edge in an appropriate neighborhood of the crossing.
Certain orders will lead to a more readable drawing than others. We formulate
several opt... | [
{
"version": "v1",
"created": "Thu, 3 May 2007 06:33:04 GMT"
}
] | 2009-07-09T00:00:00 | [
[
"Eppstein",
"David",
""
],
[
"van Kreveld",
"Marc",
""
],
[
"Mumford",
"Elena",
""
],
[
"Speckmann",
"Bettina",
""
]
] |
0705.0552 | Rajeev Raman | Rajeev Raman, Venkatesh Raman, Srinivasa Rao Satti | Succinct Indexable Dictionaries with Applications to Encoding $k$-ary
Trees, Prefix Sums and Multisets | Final version of SODA 2002 paper; supersedes Leicester Tech report
2002/16 | ACM Transactions on Algorithms vol 3 (2007), Article 43, 25pp | 10.1145/1290672.1290680 | null | cs.DS cs.DM cs.IT math.IT | null | We consider the {\it indexable dictionary} problem, which consists of storing
a set $S \subseteq \{0,...,m-1\}$ for some integer $m$, while supporting the
operations of $\Rank(x)$, which returns the number of elements in $S$ that are
less than $x$ if $x \in S$, and -1 otherwise; and $\Select(i)$ which returns
the $i$... | [
{
"version": "v1",
"created": "Fri, 4 May 2007 07:47:05 GMT"
}
] | 2011-08-10T00:00:00 | [
[
"Raman",
"Rajeev",
""
],
[
"Raman",
"Venkatesh",
""
],
[
"Satti",
"Srinivasa Rao",
""
]
] |
0705.0561 | Jingchao Chen | Jing-Chao Chen | Iterative Rounding for the Closest String Problem | This paper has been published in abstract Booklet of CiE09 | null | null | null | cs.DS cs.CC | http://creativecommons.org/licenses/by-nc-sa/3.0/ | The closest string problem is an NP-hard problem, whose task is to find a
string that minimizes maximum Hamming distance to a given set of strings. This
can be reduced to an integer program (IP). However, to date, there exists no
known polynomial-time algorithm for IP. In 2004, Meneses et al. introduced a
branch-and-... | [
{
"version": "v1",
"created": "Fri, 4 May 2007 03:01:42 GMT"
},
{
"version": "v2",
"created": "Wed, 11 May 2011 00:18:55 GMT"
}
] | 2011-05-12T00:00:00 | [
[
"Chen",
"Jing-Chao",
""
]
] |
0705.0588 | Edgar Graaf de | Edgar H. de Graaf, Joost N. Kok, Walter A. Kosters | Clustering Co-occurrence of Maximal Frequent Patterns in Streams | null | null | null | null | cs.AI cs.DS | null | One way of getting a better view of data is using frequent patterns. In this
paper frequent patterns are subsets that occur a minimal number of times in a
stream of itemsets. However, the discovery of frequent patterns in streams has
always been problematic. Because streams are potentially endless it is in
principle ... | [
{
"version": "v1",
"created": "Fri, 4 May 2007 10:36:53 GMT"
}
] | 2007-05-23T00:00:00 | [
[
"de Graaf",
"Edgar H.",
""
],
[
"Kok",
"Joost N.",
""
],
[
"Kosters",
"Walter A.",
""
]
] |
0705.0593 | Edgar Graaf de | Edgar H. de Graaf, Joost N. Kok, Walter A. Kosters | Clustering with Lattices in the Analysis of Graph Patterns | null | null | null | null | cs.AI cs.DS | null | Mining frequent subgraphs is an area of research where we have a given set of
graphs (each graph can be seen as a transaction), and we search for (connected)
subgraphs contained in many of these graphs. In this work we will discuss
techniques used in our framework Lattice2SAR for mining and analysing frequent
subgrap... | [
{
"version": "v1",
"created": "Fri, 4 May 2007 10:52:28 GMT"
}
] | 2007-05-23T00:00:00 | [
[
"de Graaf",
"Edgar H.",
""
],
[
"Kok",
"Joost N.",
""
],
[
"Kosters",
"Walter A.",
""
]
] |
0705.0933 | Max Neunh\"offer | Max Neunhoeffer, Cheryl E. Praeger | Computing Minimal Polynomials of Matrices | null | null | null | null | math.RA cs.DS | null | We present and analyse a Monte-Carlo algorithm to compute the minimal
polynomial of an $n\times n$ matrix over a finite field that requires $O(n^3)$
field operations and O(n) random vectors, and is well suited for successful
practical implementation. The algorithm, and its complexity analysis, use
standard algorithms... | [
{
"version": "v1",
"created": "Mon, 7 May 2007 15:48:12 GMT"
},
{
"version": "v2",
"created": "Mon, 7 Apr 2008 12:18:34 GMT"
}
] | 2008-04-07T00:00:00 | [
[
"Neunhoeffer",
"Max",
""
],
[
"Praeger",
"Cheryl E.",
""
]
] |
0705.1025 | David Eppstein | David Eppstein | Recognizing Partial Cubes in Quadratic Time | 25 pages, five figures. This version significantly expands previous
versions, including a new report on an implementation of the algorithm and
experiments with it | Journal of Graph Algorithms and Applications 15(2) 269-293, 2011 | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We show how to test whether a graph with n vertices and m edges is a partial
cube, and if so how to find a distance-preserving embedding of the graph into a
hypercube, in the near-optimal time bound O(n^2), improving previous O(nm)-time
solutions.
| [
{
"version": "v1",
"created": "Tue, 8 May 2007 17:59:08 GMT"
},
{
"version": "v2",
"created": "Tue, 19 Jul 2011 22:39:16 GMT"
}
] | 2011-07-21T00:00:00 | [
[
"Eppstein",
"David",
""
]
] |
0705.1033 | Kebin Wang | Michael A. Bender, Bradley C. Kuszmaul, Shang-Hua Teng, Kebin Wang | Optimal Cache-Oblivious Mesh Layouts | null | null | null | null | cs.DS cs.CE cs.MS cs.NA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A mesh is a graph that divides physical space into regularly-shaped regions.
Meshes computations form the basis of many applications, e.g. finite-element
methods, image rendering, and collision detection. In one important mesh
primitive, called a mesh update, each mesh vertex stores a value and repeatedly
updates thi... | [
{
"version": "v1",
"created": "Tue, 8 May 2007 05:59:55 GMT"
},
{
"version": "v2",
"created": "Mon, 5 Oct 2009 18:45:25 GMT"
}
] | 2009-10-05T00:00:00 | [
[
"Bender",
"Michael A.",
""
],
[
"Kuszmaul",
"Bradley C.",
""
],
[
"Teng",
"Shang-Hua",
""
],
[
"Wang",
"Kebin",
""
]
] |
0705.1364 | Mustaq Ahmed | Mustaq Ahmed and Anna Lubiw | An Approximation Algorithm for Shortest Descending Paths | 14 pages, 3 figures | null | null | null | cs.CG cs.DS | null | A path from s to t on a polyhedral terrain is descending if the height of a
point p never increases while we move p along the path from s to t. No
efficient algorithm is known to find a shortest descending path (SDP) from s to
t in a polyhedral terrain. We give a simple approximation algorithm that solves
the SDP pro... | [
{
"version": "v1",
"created": "Wed, 9 May 2007 22:02:28 GMT"
}
] | 2007-05-23T00:00:00 | [
[
"Ahmed",
"Mustaq",
""
],
[
"Lubiw",
"Anna",
""
]
] |
0705.1521 | Frank Gurski | Frank Gurski | A note on module-composed graphs | 10 pages | null | null | null | cs.DS | null | In this paper we consider module-composed graphs, i.e. graphs which can be
defined by a sequence of one-vertex insertions v_1,...,v_n, such that the
neighbourhood of vertex v_i, 2<= i<= n, forms a module (a homogeneous set) of
the graph defined by vertices v_1,..., v_{i-1}.
We show that module-composed graphs are H... | [
{
"version": "v1",
"created": "Thu, 10 May 2007 18:08:22 GMT"
},
{
"version": "v2",
"created": "Sun, 22 Jul 2007 16:30:53 GMT"
}
] | 2007-07-23T00:00:00 | [
[
"Gurski",
"Frank",
""
]
] |
0705.1750 | Peng Cui | Peng Cui | A Tighter Analysis of Setcover Greedy Algorithm for Test Set | 12 pages, 3 figures, Revised version | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Setcover greedy algorithm is a natural approximation algorithm for test set
problem. This paper gives a precise and tighter analysis of performance
guarantee of this algorithm. The author improves the performance guarantee
$2\ln n$ which derives from set cover problem to $1.1354\ln n$ by applying the
potential functi... | [
{
"version": "v1",
"created": "Sat, 12 May 2007 04:18:36 GMT"
},
{
"version": "v2",
"created": "Thu, 17 May 2007 09:32:21 GMT"
},
{
"version": "v3",
"created": "Sun, 29 Mar 2009 02:58:29 GMT"
},
{
"version": "v4",
"created": "Sat, 4 Apr 2009 02:46:12 GMT"
},
{
"ve... | 2011-03-08T00:00:00 | [
[
"Cui",
"Peng",
""
]
] |
0705.1876 | Grzegorz Malewicz | Grzegorz Malewicz | Scheduling Dags under Uncertainty | null | null | null | null | cs.DS cs.DM | null | This paper introduces a parallel scheduling problem where a directed acyclic
graph modeling $t$ tasks and their dependencies needs to be executed on $n$
unreliable workers. Worker $i$ executes task $j$ correctly with probability
$p_{i,j}$. The goal is to find a regimen $\Sigma$, that dictates how workers
get assigned... | [
{
"version": "v1",
"created": "Mon, 14 May 2007 06:54:42 GMT"
}
] | 2007-05-23T00:00:00 | [
[
"Malewicz",
"Grzegorz",
""
]
] |
0705.1970 | Nikolaos Laoutaris | Nikolaos Laoutaris | A Closed-Form Method for LRU Replacement under Generalized Power-Law
Demand | null | null | null | null | cs.DS | null | We consider the well known \emph{Least Recently Used} (LRU) replacement
algorithm and analyze it under the independent reference model and generalized
power-law demand. For this extensive family of demand distributions we derive a
closed-form expression for the per object steady-state hit ratio. To the best
of our kn... | [
{
"version": "v1",
"created": "Mon, 14 May 2007 16:04:48 GMT"
}
] | 2007-05-23T00:00:00 | [
[
"Laoutaris",
"Nikolaos",
""
]
] |
0705.1986 | Andrei Paun | Andrei Paun | On the Hopcroft's minimization algorithm | 10 pages, 1 figure | null | null | null | cs.DS | null | We show that the absolute worst case time complexity for Hopcroft's
minimization algorithm applied to unary languages is reached only for de Bruijn
words. A previous paper by Berstel and Carton gave the example of de Bruijn
words as a language that requires O(n log n) steps by carefully choosing the
splitting sets an... | [
{
"version": "v1",
"created": "Mon, 14 May 2007 17:15:53 GMT"
}
] | 2007-05-23T00:00:00 | [
[
"Paun",
"Andrei",
""
]
] |
0705.2125 | Ching-Lueh Chang | Ching-Lueh Chang, Yuh-Dauh Lyuu | Parallelized approximation algorithms for minimum routing cost spanning
trees | null | null | null | null | cs.DS cs.CC | null | We parallelize several previously proposed algorithms for the minimum routing
cost spanning tree problem and some related problems.
| [
{
"version": "v1",
"created": "Tue, 15 May 2007 17:48:42 GMT"
},
{
"version": "v2",
"created": "Wed, 4 Jul 2007 20:10:22 GMT"
}
] | 2007-07-04T00:00:00 | [
[
"Chang",
"Ching-Lueh",
""
],
[
"Lyuu",
"Yuh-Dauh",
""
]
] |
0705.2503 | Peng Cui | Peng Cui | Improved Approximability Result for Test Set with Small Redundancy | 7 pages | null | null | null | cs.DS cs.CC | null | Test set with redundancy is one of the focuses in recent bioinformatics
research. Set cover greedy algorithm (SGA for short) is a commonly used
algorithm for test set with redundancy. This paper proves that the
approximation ratio of SGA can be $(2-\frac{1}{2r})\ln n+{3/2}\ln r+O(\ln\ln
n)$ by using the potential fun... | [
{
"version": "v1",
"created": "Thu, 17 May 2007 09:53:20 GMT"
},
{
"version": "v2",
"created": "Thu, 7 Jun 2007 09:11:18 GMT"
},
{
"version": "v3",
"created": "Tue, 11 Sep 2007 09:21:21 GMT"
},
{
"version": "v4",
"created": "Thu, 27 Sep 2007 14:58:21 GMT"
}
] | 2007-09-27T00:00:00 | [
[
"Cui",
"Peng",
""
]
] |
0705.2876 | Phillip Bradford | Phillip G. Bradford and Daniel A. Ray | An online algorithm for generating fractal hash chains applied to
digital chains of custody | null | null | null | null | cs.CR cs.DS | null | This paper gives an online algorithm for generating Jakobsson's fractal hash
chains. Our new algorithm compliments Jakobsson's fractal hash chain algorithm
for preimage traversal since his algorithm assumes the entire hash chain is
precomputed and a particular list of Ceiling(log n) hash elements or pebbles
are saved... | [
{
"version": "v1",
"created": "Sun, 20 May 2007 17:14:38 GMT"
}
] | 2007-05-23T00:00:00 | [
[
"Bradford",
"Phillip G.",
""
],
[
"Ray",
"Daniel A.",
""
]
] |
0705.4171 | Eva Borbely | Eva Borbely | Grover search algorithm | null | null | null | null | cs.DS | null | A quantum algorithm is a set of instructions for a quantum computer, however,
unlike algorithms in classical computer science their results cannot be
guaranteed. A quantum system can undergo two types of operation, measurement
and quantum state transformation, operations themselves must be unitary
(reversible). Most ... | [
{
"version": "v1",
"created": "Tue, 29 May 2007 09:42:46 GMT"
}
] | 2007-05-30T00:00:00 | [
[
"Borbely",
"Eva",
""
]
] |
0705.4320 | William Hung | William N. N. Hung, Changjian Gao, Xiaoyu Song, Dan Hammerstrom | Defect-Tolerant CMOL Cell Assignment via Satisfiability | To appear in Nanoelectronic Devices for Defense and Security
(NANO-DDS), Crystal City, Virginia, June 2007 | null | null | null | cs.DM cs.DS | null | We present a CAD framework for CMOL, a hybrid CMOS/ molecular circuit
architecture. Our framework first transforms any logically synthesized circuit
based on AND/OR/NOT gates to a NOR gate circuit, and then maps the NOR gates to
CMOL. We encode the CMOL cell assignment problem as boolean conditions. The
boolean const... | [
{
"version": "v1",
"created": "Tue, 29 May 2007 23:46:38 GMT"
}
] | 2007-05-31T00:00:00 | [
[
"Hung",
"William N. N.",
""
],
[
"Gao",
"Changjian",
""
],
[
"Song",
"Xiaoyu",
""
],
[
"Hammerstrom",
"Dan",
""
]
] |
0705.4606 | Marco Pellegrini | Filippo Geraci and Marco Pellegrini | Dynamic User-Defined Similarity Searching in Semi-Structured Text
Retrieval | Submitted to Spire 2007 | null | null | null | cs.IR cs.DS | null | Modern text retrieval systems often provide a similarity search utility, that
allows the user to find efficiently a fixed number k of documents in the data
set that are most similar to a given query (here a query is either a simple
sequence of keywords or the identifier of a full document found in previous
searches t... | [
{
"version": "v1",
"created": "Thu, 31 May 2007 13:46:39 GMT"
}
] | 2007-06-01T00:00:00 | [
[
"Geraci",
"Filippo",
""
],
[
"Pellegrini",
"Marco",
""
]
] |
0705.4618 | Roberto Bagnara | Roberto Bagnara, Patricia M. Hill, Enea Zaffanella | An Improved Tight Closure Algorithm for Integer Octagonal Constraints | 15 pages, 2 figures | null | null | null | cs.DS cs.CG cs.LO | null | Integer octagonal constraints (a.k.a. ``Unit Two Variables Per Inequality''
or ``UTVPI integer constraints'') constitute an interesting class of
constraints for the representation and solution of integer problems in the
fields of constraint programming and formal analysis and verification of
software and hardware sys... | [
{
"version": "v1",
"created": "Thu, 31 May 2007 14:32:46 GMT"
},
{
"version": "v2",
"created": "Fri, 1 Jun 2007 08:17:11 GMT"
}
] | 2007-06-01T00:00:00 | [
[
"Bagnara",
"Roberto",
""
],
[
"Hill",
"Patricia M.",
""
],
[
"Zaffanella",
"Enea",
""
]
] |
0705.4673 | B\'ela Csaba | B\'ela Csaba (Anal. and Stoch. Res. Group, HAS), Andr\'as S. Pluh\'ar
(Dept. of Comp. Sci., Univ. of Szeged) | A randomized algorithm for the on-line weighted bipartite matching
problem | to be published | null | null | null | cs.DS cs.DM | null | We study the on-line minimum weighted bipartite matching problem in arbitrary
metric spaces. Here, $n$ not necessary disjoint points of a metric space $M$
are given, and are to be matched on-line with $n$ points of $M$ revealed one by
one. The cost of a matching is the sum of the distances of the matched points,
and ... | [
{
"version": "v1",
"created": "Thu, 31 May 2007 18:35:21 GMT"
},
{
"version": "v2",
"created": "Wed, 6 Jun 2007 20:24:22 GMT"
}
] | 2007-06-06T00:00:00 | [
[
"Csaba",
"Béla",
"",
"Anal. and Stoch. Res. Group, HAS"
],
[
"Pluhár",
"András S.",
"",
"Dept. of Comp. Sci., Univ. of Szeged"
]
] |
0706.0046 | Jingchao Chen | Jing-Chao Chen | Symmetry Partition Sort | null | null | null | null | cs.DS | null | In this paper, we propose a useful replacement for quicksort-style utility
functions. The replacement is called Symmetry Partition Sort, which has
essentially the same principle as Proportion Extend Sort. The maximal
difference between them is that the new algorithm always places already
partially sorted inputs (used... | [
{
"version": "v1",
"created": "Fri, 1 Jun 2007 01:47:06 GMT"
}
] | 2007-06-04T00:00:00 | [
[
"Chen",
"Jing-Chao",
""
]
] |
0706.0489 | Markus Jalsenius | Markus Jalsenius | Sampling Colourings of the Triangular Lattice | 42 pages. Added appendix that describes implementation. Added
ancillary files | null | null | null | math-ph cs.DM cs.DS math.MP | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We show that the Glauber dynamics on proper 9-colourings of the triangular
lattice is rapidly mixing, which allows for efficient sampling. Consequently,
there is a fully polynomial randomised approximation scheme (FPRAS) for
counting proper 9-colourings of the triangular lattice. Proper colourings
correspond to confi... | [
{
"version": "v1",
"created": "Mon, 4 Jun 2007 17:49:25 GMT"
},
{
"version": "v2",
"created": "Mon, 22 Mar 2010 17:49:43 GMT"
},
{
"version": "v3",
"created": "Tue, 26 Oct 2010 02:09:02 GMT"
}
] | 2010-10-27T00:00:00 | [
[
"Jalsenius",
"Markus",
""
]
] |
0706.1063 | Matthias Brust R. | Matthias R. Brust, Steffen Rothkugel | Small Worlds: Strong Clustering in Wireless Networks | To appear in: 1st International Workshop on Localized Algorithms and
Protocols for Wireless Sensor Networks (LOCALGOS 2007), 2007, IEEE Compuster
Society Press | null | null | null | cs.NI cs.DC cs.DS | null | Small-worlds represent efficient communication networks that obey two
distinguishing characteristics: a high clustering coefficient together with a
small characteristic path length. This paper focuses on an interesting paradox,
that removing links in a network can increase the overall clustering
coefficient. Reckful ... | [
{
"version": "v1",
"created": "Thu, 7 Jun 2007 19:42:51 GMT"
},
{
"version": "v2",
"created": "Mon, 11 Jun 2007 05:36:04 GMT"
}
] | 2007-06-11T00:00:00 | [
[
"Brust",
"Matthias R.",
""
],
[
"Rothkugel",
"Steffen",
""
]
] |
0706.1084 | Adam D. Smith | Sofya Raskhodnikova and Dana Ron and Ronitt Rubinfeld and Adam Smith | Sublinear Algorithms for Approximating String Compressibility | To appear in the proceedings of RANDOM 2007 | null | null | null | cs.DS | null | We raise the question of approximating the compressibility of a string with
respect to a fixed compression scheme, in sublinear time. We study this
question in detail for two popular lossless compression schemes: run-length
encoding (RLE) and Lempel-Ziv (LZ), and present sublinear algorithms for
approximating compres... | [
{
"version": "v1",
"created": "Fri, 8 Jun 2007 02:58:28 GMT"
}
] | 2007-06-11T00:00:00 | [
[
"Raskhodnikova",
"Sofya",
""
],
[
"Ron",
"Dana",
""
],
[
"Rubinfeld",
"Ronitt",
""
],
[
"Smith",
"Adam",
""
]
] |
0706.1318 | John Tomlin | S. Sathiya Keerthi and John A. Tomlin | Constructing a maximum utility slate of on-line advertisements | null | null | null | null | cs.DM cs.DS | null | We present an algorithm for constructing an optimal slate of sponsored search
advertisements which respects the ordering that is the outcome of a generalized
second price auction, but which must also accommodate complicating factors such
as overall budget constraints. The algorithm is easily fast enough to use on
the... | [
{
"version": "v1",
"created": "Sat, 9 Jun 2007 16:18:45 GMT"
}
] | 2007-06-12T00:00:00 | [
[
"Keerthi",
"S. Sathiya",
""
],
[
"Tomlin",
"John A.",
""
]
] |
0706.2155 | Greg Sepesi | Greg Sepesi | Dualheap Selection Algorithm: Efficient, Inherently Parallel and
Somewhat Mysterious | 5 pages, 6 figures | null | null | null | cs.DS cs.CC cs.DC | null | An inherently parallel algorithm is proposed that efficiently performs
selection: finding the K-th largest member of a set of N members. Selection is
a common component of many more complex algorithms and therefore is a widely
studied problem.
Not much is new in the proposed dualheap selection algorithm: the heap d... | [
{
"version": "v1",
"created": "Thu, 14 Jun 2007 16:11:24 GMT"
}
] | 2007-06-15T00:00:00 | [
[
"Sepesi",
"Greg",
""
]
] |
0706.2725 | Guohun Zhu | Guohun Zhu | The Complexity of Determining Existence a Hamiltonian Cycle is $O(n^3)$ | 6 papers | null | null | null | cs.DS cs.CC cs.DM | null | The Hamiltonian cycle problem in digraph is mapped into a matching cover
bipartite graph. Based on this mapping, it is proved that determining existence
a Hamiltonian cycle in graph is $O(n^3)$.
| [
{
"version": "v1",
"created": "Tue, 19 Jun 2007 07:57:51 GMT"
}
] | 2007-06-20T00:00:00 | [
[
"Zhu",
"Guohun",
""
]
] |
0706.2839 | Rajeev Raman | Naila Rahman and Rajeev Raman | Cache Analysis of Non-uniform Distribution Sorting Algorithms | The full version of our ESA 2000 paper (LNCS 1879) on this subject | null | null | null | cs.DS cs.PF | null | We analyse the average-case cache performance of distribution sorting
algorithms in the case when keys are independently but not necessarily
uniformly distributed. The analysis is for both `in-place' and `out-of-place'
distribution sorting algorithms and is more accurate than the analysis
presented in \cite{RRESA00}.... | [
{
"version": "v1",
"created": "Tue, 19 Jun 2007 17:12:47 GMT"
},
{
"version": "v2",
"created": "Mon, 13 Aug 2007 22:57:01 GMT"
}
] | 2007-08-14T00:00:00 | [
[
"Rahman",
"Naila",
""
],
[
"Raman",
"Rajeev",
""
]
] |
0706.2893 | Greg Sepesi | Greg Sepesi | Dualheap Sort Algorithm: An Inherently Parallel Generalization of
Heapsort | 4 pages, 4 figures | null | null | null | cs.DS cs.CC cs.DC | null | A generalization of the heapsort algorithm is proposed. At the expense of
about 50% more comparison and move operations for typical cases, the dualheap
sort algorithm offers several advantages over heapsort: improved cache
performance, better performance if the input happens to be already sorted, and
easier parallel ... | [
{
"version": "v1",
"created": "Wed, 20 Jun 2007 14:42:45 GMT"
}
] | 2007-06-21T00:00:00 | [
[
"Sepesi",
"Greg",
""
]
] |
0706.3104 | Cristina Toninelli | Marc Mezard, Cristina Toninelli | Group Testing with Random Pools: optimal two-stage algorithms | 12 pages | null | null | null | cs.DS cond-mat.dis-nn cond-mat.stat-mech cs.IT math.IT | null | We study Probabilistic Group Testing of a set of N items each of which is
defective with probability p. We focus on the double limit of small defect
probability, p<<1, and large number of variables, N>>1, taking either p->0
after $N\to\infty$ or $p=1/N^{\beta}$ with $\beta\in(0,1/2)$. In both settings
the optimal num... | [
{
"version": "v1",
"created": "Thu, 21 Jun 2007 08:57:44 GMT"
}
] | 2007-11-14T00:00:00 | [
[
"Mezard",
"Marc",
""
],
[
"Toninelli",
"Cristina",
""
]
] |
0706.3565 | Anatoly Plotnikov | Anatoly D. Plotnikov | Experimental Algorithm for the Maximum Independent Set Problem | From author's book "Discrete mathematics",3-th ed., Moscow,New
knowledge,2007, 18 pages, 8 figures | Cybernetics and Systems Analysis: Volume 48, Issue 5 (2012), Page
673-680 | null | null | cs.DS | null | We develop an experimental algorithm for the exact solving of the maximum
independent set problem. The algorithm consecutively finds the maximal
independent sets of vertices in an arbitrary undirected graph such that the
next such set contains more elements than the preceding one. For this purpose,
we use a technique... | [
{
"version": "v1",
"created": "Mon, 25 Jun 2007 06:45:49 GMT"
},
{
"version": "v2",
"created": "Mon, 2 Jul 2007 02:16:12 GMT"
}
] | 2016-03-02T00:00:00 | [
[
"Plotnikov",
"Anatoly D.",
""
]
] |
0706.4107 | Mihai Patrascu | Gianni Franceschini, S. Muthukrishnan and Mihai Patrascu | Radix Sorting With No Extra Space | Full version of paper accepted to ESA 2007. (17 pages) | null | null | null | cs.DS | null | It is well known that n integers in the range [1,n^c] can be sorted in O(n)
time in the RAM model using radix sorting. More generally, integers in any
range [1,U] can be sorted in O(n sqrt{loglog n}) time. However, these
algorithms use O(n) words of extra memory. Is this necessary?
We present a simple, stable, inte... | [
{
"version": "v1",
"created": "Wed, 27 Jun 2007 22:04:40 GMT"
}
] | 2007-06-29T00:00:00 | [
[
"Franceschini",
"Gianni",
""
],
[
"Muthukrishnan",
"S.",
""
],
[
"Patrascu",
"Mihai",
""
]
] |
0707.0282 | Igor Razgon | Igor Razgon and Barry O'Sullivan | Directed Feedback Vertex Set is Fixed-Parameter Tractable | 14 pages | null | null | null | cs.DS cs.CC | null | We resolve positively a long standing open question regarding the
fixed-parameter tractability of the parameterized Directed Feedback Vertex Set
problem. In particular, we propose an algorithm which solves this problem in
$O(8^kk!*poly(n))$.
| [
{
"version": "v1",
"created": "Mon, 2 Jul 2007 17:56:53 GMT"
}
] | 2007-07-03T00:00:00 | [
[
"Razgon",
"Igor",
""
],
[
"O'Sullivan",
"Barry",
""
]
] |
0707.0421 | Riccardo Dondi | Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi | The $k$-anonymity Problem is Hard | 21 pages, A short version of this paper has been accepted in FCT 2009
- 17th International Symposium on Fundamentals of Computation Theory | null | null | null | cs.DB cs.CC cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The problem of publishing personal data without giving up privacy is becoming
increasingly important. An interesting formalization recently proposed is the
k-anonymity. This approach requires that the rows in a table are clustered in
sets of size at least k and that all the rows in a cluster become the same
tuple, af... | [
{
"version": "v1",
"created": "Tue, 3 Jul 2007 14:17:49 GMT"
},
{
"version": "v2",
"created": "Tue, 2 Jun 2009 16:40:37 GMT"
}
] | 2009-06-02T00:00:00 | [
[
"Bonizzoni",
"Paola",
""
],
[
"Della Vedova",
"Gianluca",
""
],
[
"Dondi",
"Riccardo",
""
]
] |
0707.0546 | Juli\'an Mestre | Juli\'an Mestre | Weighted Popular Matchings | 14 pages, 3 figures. A preliminary version appeared in the
Proceedings of the 33rd International Colloquium on Automata, Languages and
Programming (ICALP) | null | null | null | cs.DS | null | We study the problem of assigning jobs to applicants. Each applicant has a
weight and provides a preference list ranking a subset of the jobs. A matching
M is popular if there is no other matching M' such that the weight of the
applicants who prefer M' over M exceeds the weight of those who prefer M over
M'. This pap... | [
{
"version": "v1",
"created": "Wed, 4 Jul 2007 06:55:43 GMT"
}
] | 2007-07-05T00:00:00 | [
[
"Mestre",
"Julián",
""
]
] |
0707.0644 | Ali Akhavi | Ali Akhavi (GREYC), C\'eline Moreira (GREYC) | Another view of the Gaussian algorithm | null | Proceedings of Latin'04 (04/2004) 474--487 | null | null | cs.DS cs.DM | null | We introduce here a rewrite system in the group of unimodular matrices,
\emph{i.e.}, matrices with integer entries and with determinant equal to $\pm
1$. We use this rewrite system to precisely characterize the mechanism of the
Gaussian algorithm, that finds shortest vectors in a two--dimensional lattice
given by any... | [
{
"version": "v1",
"created": "Wed, 4 Jul 2007 15:37:15 GMT"
}
] | 2007-07-05T00:00:00 | [
[
"Akhavi",
"Ali",
"",
"GREYC"
],
[
"Moreira",
"Céline",
"",
"GREYC"
]
] |
0707.0648 | Viswanath Nagarajan | Anupam Gupta, MohammadTaghi Hajiaghayi, Viswanath Nagarajan, R. Ravi | Dial a Ride from k-forest | Preliminary version in Proc. European Symposium on Algorithms, 2007 | null | null | null | cs.DS | null | The k-forest problem is a common generalization of both the k-MST and the
dense-$k$-subgraph problems. Formally, given a metric space on $n$ vertices
$V$, with $m$ demand pairs $\subseteq V \times V$ and a ``target'' $k\le m$,
the goal is to find a minimum cost subgraph that connects at least $k$ demand
pairs. In thi... | [
{
"version": "v1",
"created": "Wed, 4 Jul 2007 16:08:40 GMT"
}
] | 2007-07-05T00:00:00 | [
[
"Gupta",
"Anupam",
""
],
[
"Hajiaghayi",
"MohammadTaghi",
""
],
[
"Nagarajan",
"Viswanath",
""
],
[
"Ravi",
"R.",
""
]
] |
0707.1051 | Mark Braverman | Mark Braverman, Elchanan Mossel | Noisy Sorting Without Resampling | null | null | null | null | cs.DS | null | In this paper we study noisy sorting without re-sampling. In this problem
there is an unknown order $a_{\pi(1)} < ... < a_{\pi(n)}$ where $\pi$ is a
permutation on $n$ elements. The input is the status of $n \choose 2$ queries
of the form $q(a_i,x_j)$, where $q(a_i,a_j) = +$ with probability at least
$1/2+\ga$ if $\p... | [
{
"version": "v1",
"created": "Fri, 6 Jul 2007 21:30:24 GMT"
}
] | 2007-07-10T00:00:00 | [
[
"Braverman",
"Mark",
""
],
[
"Mossel",
"Elchanan",
""
]
] |
0707.1095 | Gregory Gutin | Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket
Saurabh | Better Algorithms and Bounds for Directed Maximum Leaf Problems | null | null | null | null | cs.DS cs.DM | null | The {\sc Directed Maximum Leaf Out-Branching} problem is to find an
out-branching (i.e. a rooted oriented spanning tree) in a given digraph with
the maximum number of leaves. In this paper, we improve known parameterized
algorithms and combinatorial bounds on the number of leaves in out-branchings.
We show that
\be... | [
{
"version": "v1",
"created": "Sat, 7 Jul 2007 15:52:29 GMT"
}
] | 2007-07-10T00:00:00 | [
[
"Alon",
"Noga",
""
],
[
"Fomin",
"Fedor V.",
""
],
[
"Gutin",
"Gregory",
""
],
[
"Krivelevich",
"Michael",
""
],
[
"Saurabh",
"Saket",
""
]
] |
0707.1532 | Samantha Riesenfeld | Constantinos Daskalakis (1), Richard M. Karp (1), Elchanan Mossel (1),
Samantha Riesenfeld (1), Elad Verbin (2) ((1) U.C. Berkeley, (2) Tel Aviv
University) | Sorting and Selection in Posets | 24 pages | null | null | null | cs.DS cs.DM | null | Classical problems of sorting and searching assume an underlying linear
ordering of the objects being compared. In this paper, we study a more general
setting, in which some pairs of objects are incomparable. This generalization
is relevant in applications related to rankings in sports, college admissions,
or confere... | [
{
"version": "v1",
"created": "Tue, 10 Jul 2007 21:52:17 GMT"
}
] | 2007-07-12T00:00:00 | [
[
"Daskalakis",
"Constantinos",
""
],
[
"Karp",
"Richard M.",
""
],
[
"Mossel",
"Elchanan",
""
],
[
"Riesenfeld",
"Samantha",
""
],
[
"Verbin",
"Elad",
""
]
] |
0707.1714 | Michael Mahoney | Anirban Dasgupta, Petros Drineas, Boulos Harb, Ravi Kumar, and Michael
W. Mahoney | Sampling Algorithms and Coresets for Lp Regression | 19 pages, 1 figure | null | null | null | cs.DS | null | The Lp regression problem takes as input a matrix $A \in \Real^{n \times d}$,
a vector $b \in \Real^n$, and a number $p \in [1,\infty)$, and it returns as
output a number ${\cal Z}$ and a vector $x_{opt} \in \Real^d$ such that ${\cal
Z} = \min_{x \in \Real^d} ||Ax -b||_p = ||Ax_{opt}-b||_p$. In this paper, we
constru... | [
{
"version": "v1",
"created": "Wed, 11 Jul 2007 22:04:18 GMT"
}
] | 2007-07-13T00:00:00 | [
[
"Dasgupta",
"Anirban",
""
],
[
"Drineas",
"Petros",
""
],
[
"Harb",
"Boulos",
""
],
[
"Kumar",
"Ravi",
""
],
[
"Mahoney",
"Michael W.",
""
]
] |
0707.2160 | Seth Pettie | Seth Pettie | Splay Trees, Davenport-Schinzel Sequences, and the Deque Conjecture | null | null | null | null | cs.DS | null | We introduce a new technique to bound the asymptotic performance of splay
trees. The basic idea is to transcribe, in an indirect fashion, the rotations
performed by the splay tree as a Davenport-Schinzel sequence S, none of whose
subsequences are isomorphic to fixed forbidden subsequence. We direct this
technique tow... | [
{
"version": "v1",
"created": "Sat, 14 Jul 2007 16:38:08 GMT"
}
] | 2007-07-17T00:00:00 | [
[
"Pettie",
"Seth",
""
]
] |
0707.2701 | Gernot Schaller | Gernot Schaller | A fixed point iteration for computing the matrix logarithm | 4 pages, 3 figures, comments welcome | null | null | null | cs.NA cs.DS | null | In various areas of applied numerics, the problem of calculating the
logarithm of a matrix A emerges. Since series expansions of the logarithm
usually do not converge well for matrices far away from the identity, the
standard numerical method calculates successive square roots. In this article,
a new algorithm is pre... | [
{
"version": "v1",
"created": "Wed, 18 Jul 2007 11:04:27 GMT"
}
] | 2007-07-19T00:00:00 | [
[
"Schaller",
"Gernot",
""
]
] |
0707.3407 | Alexander Tiskin | Alexander Tiskin | Faster subsequence recognition in compressed strings | null | null | null | null | cs.DS cs.CC cs.DM | null | Computation on compressed strings is one of the key approaches to processing
massive data sets. We consider local subsequence recognition problems on
strings compressed by straight-line programs (SLP), which is closely related to
Lempel--Ziv compression. For an SLP-compressed text of length $\bar m$, and an
uncompres... | [
{
"version": "v1",
"created": "Mon, 23 Jul 2007 16:26:24 GMT"
},
{
"version": "v2",
"created": "Tue, 6 Nov 2007 14:16:07 GMT"
},
{
"version": "v3",
"created": "Fri, 11 Jan 2008 21:54:54 GMT"
},
{
"version": "v4",
"created": "Fri, 18 Jan 2008 10:20:48 GMT"
}
] | 2011-11-10T00:00:00 | [
[
"Tiskin",
"Alexander",
""
]
] |
0707.3409 | Alexander Tiskin | Alexander Tiskin | Faster exon assembly by sparse spliced alignment | null | null | null | null | cs.DS cs.CC cs.CE q-bio.QM | null | Assembling a gene from candidate exons is an important problem in
computational biology. Among the most successful approaches to this problem is
\emph{spliced alignment}, proposed by Gelfand et al., which scores different
candidate exon chains within a DNA sequence of length $m$ by comparing them to
a known related g... | [
{
"version": "v1",
"created": "Mon, 23 Jul 2007 16:35:54 GMT"
}
] | 2007-07-24T00:00:00 | [
[
"Tiskin",
"Alexander",
""
]
] |
0707.3619 | Alexander Tiskin | Alexander Tiskin | Semi-local string comparison: algorithmic techniques and applications | null | null | null | null | cs.DS cs.DM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A classical measure of string comparison is given by the longest common
subsequence (LCS) problem on a pair of strings. We consider its generalisation,
called the semi-local LCS problem, which arises naturally in many
string-related problems. The semi-local LCS problem asks for the LCS scores for
each of the input st... | [
{
"version": "v1",
"created": "Tue, 24 Jul 2007 19:12:23 GMT"
},
{
"version": "v10",
"created": "Wed, 5 Aug 2009 16:07:43 GMT"
},
{
"version": "v11",
"created": "Thu, 20 Aug 2009 22:16:33 GMT"
},
{
"version": "v12",
"created": "Mon, 31 Aug 2009 13:08:55 GMT"
},
{
... | 2015-03-13T00:00:00 | [
[
"Tiskin",
"Alexander",
""
]
] |
0707.3622 | Yaoyun Shi | Igor Markov (University of Michigan) and Yaoyun Shi (University of
Michigan) | Constant-degree graph expansions that preserve the treewidth | 12 pages, 6 figures, the main result used by quant-ph/0511070 | Algorithmica, Volume 59, Number 4, 461-470,2011 | 10.1007/s00453-009-9312-5 | null | cs.DM cs.DS math.CO quant-ph | null | Many hard algorithmic problems dealing with graphs, circuits, formulas and
constraints admit polynomial-time upper bounds if the underlying graph has
small treewidth. The same problems often encourage reducing the maximal degree
of vertices to simplify theoretical arguments or address practical concerns.
Such degree ... | [
{
"version": "v1",
"created": "Tue, 24 Jul 2007 19:56:27 GMT"
}
] | 2011-11-04T00:00:00 | [
[
"Markov",
"Igor",
"",
"University of Michigan"
],
[
"Shi",
"Yaoyun",
"",
"University of\n Michigan"
]
] |
0707.4448 | Mohamed-Ali Belabbas | Mohamed-Ali Belabbas and Patrick J. Wolfe | On sparse representations of linear operators and the approximation of
matrix products | 6 pages, 3 figures; presented at the 42nd Annual Conference on
Information Sciences and Systems (CISS 2008) | null | 10.1109/CISS.2008.4558532 | null | cs.DS cs.CC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Thus far, sparse representations have been exploited largely in the context
of robustly estimating functions in a noisy environment from a few
measurements. In this context, the existence of a basis in which the signal
class under consideration is sparse is used to decrease the number of necessary
measurements while ... | [
{
"version": "v1",
"created": "Mon, 30 Jul 2007 17:20:23 GMT"
},
{
"version": "v2",
"created": "Fri, 26 Jun 2009 12:04:44 GMT"
}
] | 2009-06-26T00:00:00 | [
[
"Belabbas",
"Mohamed-Ali",
""
],
[
"Wolfe",
"Patrick J.",
""
]
] |
0708.0600 | Michael Lee | Michael J. Lee | Complementary algorithms for graphs and percolation | 5 pages, 3 figures, poster version presented at statphys23 (2007) | null | 10.1103/PhysRevE.76.027702 | null | cs.DS | null | A pair of complementary algorithms are presented. One of the pair is a fast
method for connecting graphs with an edge. The other is a fast method for
removing edges from a graph. Both algorithms employ the same tree based graph
representation and so, in concert, can arbitrarily modify any graph. Since the
clusters of... | [
{
"version": "v1",
"created": "Sat, 4 Aug 2007 02:56:13 GMT"
}
] | 2009-11-13T00:00:00 | [
[
"Lee",
"Michael J.",
""
]
] |
0708.0909 | Sebastien Tixeuil | L\'elia Blin (IBISC), Maria Gradinariu Potop-Butucaru (INRIA
Rocquencourt, LIP6), S\'ebastien Tixeuil (INRIA Futurs, LRI) | On the Self-stabilization of Mobile Robots in Graphs | null | null | null | null | cs.DS cs.DC | null | Self-stabilization is a versatile technique to withstand any transient fault
in a distributed system. Mobile robots (or agents) are one of the emerging
trends in distributed computing as they mimic autonomous biologic entities. The
contribution of this paper is threefold. First, we present a new model for
studying mo... | [
{
"version": "v1",
"created": "Tue, 7 Aug 2007 09:34:14 GMT"
},
{
"version": "v2",
"created": "Wed, 8 Aug 2007 09:11:22 GMT"
}
] | 2009-09-29T00:00:00 | [
[
"Blin",
"Lélia",
"",
"IBISC"
],
[
"Potop-Butucaru",
"Maria Gradinariu",
"",
"INRIA\n Rocquencourt, LIP6"
],
[
"Tixeuil",
"Sébastien",
"",
"INRIA Futurs, LRI"
]
] |
0708.2351 | Judit Nagy-Gy\"orgy | Judit Nagy-Gy\"orgy | Randomized algorithm for the k-server problem on decomposable spaces | 11 pages | null | null | null | cs.DS cs.DM | null | We study the randomized k-server problem on metric spaces consisting of
widely separated subspaces. We give a method which extends existing algorithms
to larger spaces with the growth rate of the competitive quotients being at
most O(log k). This method yields o(k)-competitive algorithms solving the
randomized k-serv... | [
{
"version": "v1",
"created": "Fri, 17 Aug 2007 11:54:44 GMT"
}
] | 2007-08-20T00:00:00 | [
[
"Nagy-György",
"Judit",
""
]
] |
0708.2544 | Gregory Gutin | G. Gutin and E.J. Kim | On the Complexity of the Minimum Cost Homomorphism Problem for Reflexive
Multipartite Tournaments | null | null | null | null | cs.DM cs.DS | null | For digraphs $D$ and $H$, a mapping $f: V(D)\dom V(H)$ is a homomorphism of
$D$ to $H$ if $uv\in A(D)$ implies $f(u)f(v)\in A(H).$ For a fixed digraph $H$,
the homomorphism problem is to decide whether an input digraph $D$ admits a
homomorphism to $H$ or not, and is denoted as HOMP($H$). Digraphs are allowed
to have ... | [
{
"version": "v1",
"created": "Sun, 19 Aug 2007 13:00:59 GMT"
}
] | 2007-08-21T00:00:00 | [
[
"Gutin",
"G.",
""
],
[
"Kim",
"E. J.",
""
]
] |
0708.2545 | Gregory Gutin | E.J. Kim and G. Gutin | Complexity of the Minimum Cost Homomorphism Problem for Semicomplete
Digraphs with Possible Loops | null | null | null | null | cs.DM cs.DS | null | For digraphs $D$ and $H$, a mapping $f: V(D)\dom V(H)$ is a homomorphism of
$D$ to $H$ if $uv\in A(D)$ implies $f(u)f(v)\in A(H).$ For a fixed digraph $H$,
the homomorphism problem is to decide whether an input digraph $D$ admits a
homomorphism to $H$ or not, and is denoted as HOM($H$).
An optimization version of t... | [
{
"version": "v1",
"created": "Sun, 19 Aug 2007 13:47:00 GMT"
}
] | 2007-08-21T00:00:00 | [
[
"Kim",
"E. J.",
""
],
[
"Gutin",
"G.",
""
]
] |
0708.2936 | David P{\l}aneta S | David S. Planeta | Priority Queue Based on Multilevel Prefix Tree | null | null | null | null | cs.DS | null | Tree structures are very often used data structures. Among ordered types of
trees there are many variants whose basic operations such as insert, delete,
search, delete-min are characterized by logarithmic time complexity. In the
article I am going to present the structure whose time complexity for each of
the above o... | [
{
"version": "v1",
"created": "Tue, 21 Aug 2007 22:59:49 GMT"
}
] | 2007-08-23T00:00:00 | [
[
"Planeta",
"David S.",
""
]
] |
0708.3259 | Rasmus Pagh | Philip Bille, Anna Pagh, Rasmus Pagh | Fast evaluation of union-intersection expressions | null | null | null | null | cs.DS cs.DB cs.IR | null | We show how to represent sets in a linear space data structure such that
expressions involving unions and intersections of sets can be computed in a
worst-case efficient way. This problem has applications in e.g. information
retrieval and database systems. We mainly consider the RAM model of
computation, and sets of ... | [
{
"version": "v1",
"created": "Thu, 23 Aug 2007 22:23:04 GMT"
}
] | 2007-08-27T00:00:00 | [
[
"Bille",
"Philip",
""
],
[
"Pagh",
"Anna",
""
],
[
"Pagh",
"Rasmus",
""
]
] |
0708.3408 | David P{\l}aneta S | David S. Planeta | Linear Time Algorithms Based on Multilevel Prefix Tree for Finding
Shortest Path with Positive Weights and Minimum Spanning Tree in a Networks | null | null | null | null | cs.DS | null | In this paper I present general outlook on questions relevant to the basic
graph algorithms; Finding the Shortest Path with Positive Weights and Minimum
Spanning Tree. I will show so far known solution set of basic graph problems
and present my own. My solutions to graph problems are characterized by their
linear wor... | [
{
"version": "v1",
"created": "Fri, 24 Aug 2007 21:58:29 GMT"
}
] | 2007-08-28T00:00:00 | [
[
"Planeta",
"David S.",
""
]
] |
0708.3696 | Michael Mahoney | Petros Drineas, Michael W. Mahoney and S. Muthukrishnan | Relative-Error CUR Matrix Decompositions | 40 pages, 10 figures | null | null | null | cs.DS | null | Many data analysis applications deal with large matrices and involve
approximating the matrix using a small number of ``components.'' Typically,
these components are linear combinations of the rows and columns of the matrix,
and are thus difficult to interpret in terms of the original features of the
input data. In t... | [
{
"version": "v1",
"created": "Mon, 27 Aug 2007 23:34:50 GMT"
}
] | 2007-08-29T00:00:00 | [
[
"Drineas",
"Petros",
""
],
[
"Mahoney",
"Michael W.",
""
],
[
"Muthukrishnan",
"S.",
""
]
] |
0708.4284 | Mariano Zelke | Mariano Zelke | Optimal Per-Edge Processing Times in the Semi-Streaming Model | 8 pages, 1 table | Information Processing Letters, Volume 104, Issue 3, 2007, Pages
106-112 | null | null | cs.DM cs.DS | null | We present semi-streaming algorithms for basic graph problems that have
optimal per-edge processing times and therefore surpass all previous
semi-streaming algorithms for these tasks. The semi-streaming model, which is
appropriate when dealing with massive graphs, forbids random access to the
input and restricts the ... | [
{
"version": "v1",
"created": "Fri, 31 Aug 2007 07:19:27 GMT"
}
] | 2007-09-03T00:00:00 | [
[
"Zelke",
"Mariano",
""
]
] |
0708.4288 | Philip Bille | Philip Bille | Pattern Matching in Trees and Strings | PhD dissertation, 140 pages | null | null | null | cs.DS | null | We study the design of efficient algorithms for combinatorial pattern
matching. More concretely, we study algorithms for tree matching, string
matching, and string matching in compressed texts.
| [
{
"version": "v1",
"created": "Fri, 31 Aug 2007 08:07:32 GMT"
}
] | 2007-09-03T00:00:00 | [
[
"Bille",
"Philip",
""
]
] |
0708.4399 | Steven G. Johnson | Xuancheng Shao and Steven G. Johnson | Type-IV DCT, DST, and MDCT algorithms with reduced numbers of arithmetic
operations | 11 pages | Signal Processing vol. 88, issue 6, p. 1313-1326 (2008) | 10.1016/j.sigpro.2007.11.024 | null | cs.DS cs.NA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present algorithms for the type-IV discrete cosine transform (DCT-IV) and
discrete sine transform (DST-IV), as well as for the modified discrete cosine
transform (MDCT) and its inverse, that achieve a lower count of real
multiplications and additions than previously published algorithms, without
sacrificing numeri... | [
{
"version": "v1",
"created": "Fri, 31 Aug 2007 18:00:33 GMT"
},
{
"version": "v2",
"created": "Thu, 29 Jan 2009 19:18:21 GMT"
}
] | 2009-01-29T00:00:00 | [
[
"Shao",
"Xuancheng",
""
],
[
"Johnson",
"Steven G.",
""
]
] |
0709.0511 | Oskar Sandberg | Oskar Sandberg | Double Clustering and Graph Navigability | null | null | null | null | math.PR cs.DS math.CO | null | Graphs are called navigable if one can find short paths through them using
only local knowledge. It has been shown that for a graph to be navigable, its
construction needs to meet strict criteria. Since such graphs nevertheless seem
to appear in nature, it is of interest to understand why these criteria should
be ful... | [
{
"version": "v1",
"created": "Tue, 4 Sep 2007 19:38:14 GMT"
}
] | 2007-09-05T00:00:00 | [
[
"Sandberg",
"Oskar",
""
]
] |
0709.0624 | Martin Ziegler | Katharina L\"urwer-Br\"uggemeier and Martin Ziegler | On Faster Integer Calculations using Non-Arithmetic Primitives | null | null | null | null | cs.DS | null | The unit cost model is both convenient and largely realistic for describing
integer decision algorithms over (+,*). Additional operations like division
with remainder or bitwise conjunction, although equally supported by computing
hardware, may lead to a considerable drop in complexity. We show a variety of
concrete ... | [
{
"version": "v1",
"created": "Wed, 5 Sep 2007 11:34:54 GMT"
}
] | 2007-09-06T00:00:00 | [
[
"Lürwer-Brüggemeier",
"Katharina",
""
],
[
"Ziegler",
"Martin",
""
]
] |
0709.0670 | Daniil Ryabko | Daniil Ryabko, Juergen Schmidhuber | Using Data Compressors to Construct Rank Tests | null | Applied Mathematics Letters, 22:7, 1029-1032, 2009 | null | null | cs.DS cs.IT math.IT | null | Nonparametric rank tests for homogeneity and component independence are
proposed, which are based on data compressors. For homogeneity testing the idea
is to compress the binary string obtained by ordering the two joint samples and
writing 0 if the element is from the first sample and 1 if it is from the
second sampl... | [
{
"version": "v1",
"created": "Wed, 5 Sep 2007 15:06:04 GMT"
}
] | 2012-02-28T00:00:00 | [
[
"Ryabko",
"Daniil",
""
],
[
"Schmidhuber",
"Juergen",
""
]
] |
0709.0677 | Binhai Zhu | Binhai Zhu | On the Complexity of Protein Local Structure Alignment Under the
Discrete Fr\'echet Distance | 11 pages, 2 figures | null | null | null | cs.CC cs.DS | null | We show that given $m$ proteins (or protein backbones, which are modeled as
3D polygonal chains each of length O(n)) the problem of protein local structure
alignment under the discrete Fr\'{e}chet distance is as hard as Independent
Set. So the problem does not admit any approximation of factor
$n^{1-\epsilon}$. This ... | [
{
"version": "v1",
"created": "Wed, 5 Sep 2007 15:30:54 GMT"
}
] | 2007-09-06T00:00:00 | [
[
"Zhu",
"Binhai",
""
]
] |
0709.0974 | Sergey Gubin | Sergey Gubin | Finding Paths and Cycles in Graphs | 11 pages | null | null | null | cs.DM cs.CC cs.DS math.CO | null | A polynomial time algorithm which detects all paths and cycles of all lengths
in form of vertex pairs (start, finish).
| [
{
"version": "v1",
"created": "Fri, 7 Sep 2007 00:04:20 GMT"
}
] | 2007-09-10T00:00:00 | [
[
"Gubin",
"Sergey",
""
]
] |
0709.1227 | Yanghua Xiao | Yanghua Xiao, Wentao Wu, Wei Wang and Zhengying He | Efficient Algorithms for Node Disjoint Subgraph Homeomorphism
Determination | 15 pages, 11 figures, submitted to DASFAA 2008 | In Proceeding of 13th International Conference on Database Systems
for Advanced Applications, 2008 | 10.1007/978-3-540-78568-2 | null | cs.DS cs.DB | null | Recently, great efforts have been dedicated to researches on the management
of large scale graph based data such as WWW, social networks, biological
networks. In the study of graph based data management, node disjoint subgraph
homeomorphism relation between graphs is more suitable than (sub)graph
isomorphism in many ... | [
{
"version": "v1",
"created": "Sat, 8 Sep 2007 18:14:47 GMT"
}
] | 2008-10-09T00:00:00 | [
[
"Xiao",
"Yanghua",
""
],
[
"Wu",
"Wentao",
""
],
[
"Wang",
"Wei",
""
],
[
"He",
"Zhengying",
""
]
] |
0709.2016 | Konstantin Avrachenkov | Konstantin Avrachenkov, Nelly Litvak, Kim Son Pham | Distribution of PageRank Mass Among Principle Components of the Web | null | null | null | null | cs.NI cs.DS | null | We study the PageRank mass of principal components in a bow-tie Web Graph, as
a function of the damping factor c. Using a singular perturbation approach, we
show that the PageRank share of IN and SCC components remains high even for
very large values of the damping factor, in spite of the fact that it drops to
zero w... | [
{
"version": "v1",
"created": "Thu, 13 Sep 2007 08:29:53 GMT"
}
] | 2007-09-14T00:00:00 | [
[
"Avrachenkov",
"Konstantin",
""
],
[
"Litvak",
"Nelly",
""
],
[
"Pham",
"Kim Son",
""
]
] |
0709.2562 | Paolo Laureti | Marcel Blattner, Alexander Hunziker, Paolo Laureti | When are recommender systems useful? | null | null | null | null | cs.IR cs.CY cs.DL cs.DS physics.data-an physics.soc-ph | null | Recommender systems are crucial tools to overcome the information overload
brought about by the Internet. Rigorous tests are needed to establish to what
extent sophisticated methods can improve the quality of the predictions. Here
we analyse a refined correlation-based collaborative filtering algorithm and
compare it... | [
{
"version": "v1",
"created": "Mon, 17 Sep 2007 09:27:07 GMT"
}
] | 2007-09-19T00:00:00 | [
[
"Blattner",
"Marcel",
""
],
[
"Hunziker",
"Alexander",
""
],
[
"Laureti",
"Paolo",
""
]
] |
0709.2961 | Andreas Schutt | Andreas Schutt and Peter J. Stuckey | Incremental Satisfiability and Implication for UTVPI Constraints | 14 pages, 1 figure | null | null | null | cs.DS cs.CG cs.LO | null | Unit two-variable-per-inequality (UTVPI) constraints form one of the largest
class of integer constraints which are polynomial time solvable (unless P=NP).
There is considerable interest in their use for constraint solving, abstract
interpretation, spatial databases, and theorem proving. In this paper we
develop a ne... | [
{
"version": "v1",
"created": "Wed, 19 Sep 2007 06:58:05 GMT"
}
] | 2007-09-20T00:00:00 | [
[
"Schutt",
"Andreas",
""
],
[
"Stuckey",
"Peter J.",
""
]
] |
0709.3034 | Anastasia Analyti | Carlo Meghini, Yannis Tzitzikas, Anastasia Analyti | Query Evaluation in P2P Systems of Taxonomy-based Sources: Algorithms,
Complexity, and Optimizations | null | null | null | null | cs.DB cs.DC cs.DS cs.LO | null | In this study, we address the problem of answering queries over a
peer-to-peer system of taxonomy-based sources. A taxonomy states subsumption
relationships between negation-free DNF formulas on terms and negation-free
conjunctions of terms. To the end of laying the foundations of our study, we
first consider the cen... | [
{
"version": "v1",
"created": "Wed, 19 Sep 2007 15:10:05 GMT"
}
] | 2007-09-20T00:00:00 | [
[
"Meghini",
"Carlo",
""
],
[
"Tzitzikas",
"Yannis",
""
],
[
"Analyti",
"Anastasia",
""
]
] |
0709.3384 | Mariano Zelke | Mariano Zelke | Weighted Matching in the Semi-Streaming Model | 12 pages, 2 figures | Proceedings of the 25th Annual Symposium on the Theoretical
Aspects of Computer Science - STACS 2008, Bordeaux : France (2008) | null | null | cs.DM cs.DS | null | We reduce the best known approximation ratio for finding a weighted matching
of a graph using a one-pass semi-streaming algorithm from 5.828 to 5.585. The
semi-streaming model forbids random access to the input and restricts the
memory to O(n*polylog(n)) bits. It was introduced by Muthukrishnan in 2003 and
is appropr... | [
{
"version": "v1",
"created": "Fri, 21 Sep 2007 09:34:19 GMT"
}
] | 2008-02-25T00:00:00 | [
[
"Zelke",
"Mariano",
""
]
] |
0709.4273 | Sergey Gubin | Sergey Gubin | Set Matrices and The Path/Cycle Problem | 7 pages | null | null | null | cs.DM cs.CC cs.DS math.CO | null | Presentation of set matrices and demonstration of their efficiency as a tool
using the path/cycle problem.
| [
{
"version": "v1",
"created": "Wed, 26 Sep 2007 21:44:10 GMT"
}
] | 2007-09-28T00:00:00 | [
[
"Gubin",
"Sergey",
""
]
] |
0710.0083 | Andrew McGregor | Stanislav Angelov, Keshav Kunal, Andrew McGregor | Sorting and Selection with Random Costs | null | null | null | null | cs.DS | null | There is a growing body of work on sorting and selection in models other than
the unit-cost comparison model. This work is the first treatment of a natural
stochastic variant of the problem where the cost of comparing two elements is a
random variable. Each cost is chosen independently and is known to the
algorithm. ... | [
{
"version": "v1",
"created": "Sat, 29 Sep 2007 18:10:28 GMT"
}
] | 2007-10-02T00:00:00 | [
[
"Angelov",
"Stanislav",
""
],
[
"Kunal",
"Keshav",
""
],
[
"McGregor",
"Andrew",
""
]
] |
0710.0262 | Sebastian Roch | Elchanan Mossel and Sebastien Roch | Incomplete Lineage Sorting: Consistent Phylogeny Estimation From
Multiple Loci | Added a section on more general distance-based methods | null | null | null | q-bio.PE cs.CE cs.DS math.PR math.ST stat.TH | null | We introduce a simple algorithm for reconstructing phylogenies from multiple
gene trees in the presence of incomplete lineage sorting, that is, when the
topology of the gene trees may differ from that of the species tree. We show
that our technique is statistically consistent under standard stochastic
assumptions, th... | [
{
"version": "v1",
"created": "Mon, 1 Oct 2007 11:11:43 GMT"
},
{
"version": "v2",
"created": "Fri, 2 Nov 2007 03:41:04 GMT"
}
] | 2011-09-30T00:00:00 | [
[
"Mossel",
"Elchanan",
""
],
[
"Roch",
"Sebastien",
""
]
] |
0710.0318 | Alexander Tiskin | Vladimir Deineko and Alexander Tiskin | Fast minimum-weight double-tree shortcutting for Metric TSP: Is the best
one good enough? | null | null | null | null | cs.DS cs.CC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The Metric Traveling Salesman Problem (TSP) is a classical NP-hard
optimization problem. The double-tree shortcutting method for Metric TSP yields
an exponentially-sized space of TSP tours, each of which approximates the
optimal solution within at most a factor of 2. We consider the problem of
finding among these tou... | [
{
"version": "v1",
"created": "Mon, 1 Oct 2007 15:25:18 GMT"
},
{
"version": "v2",
"created": "Sat, 20 Jun 2009 16:17:30 GMT"
},
{
"version": "v3",
"created": "Thu, 16 Jul 2009 16:17:25 GMT"
}
] | 2009-07-16T00:00:00 | [
[
"Deineko",
"Vladimir",
""
],
[
"Tiskin",
"Alexander",
""
]
] |
0710.0539 | Anthony A. Ruffa | Anthony A. Ruffa | A Novel Solution to the ATT48 Benchmark Problem | null | null | null | null | cs.DS cs.CC | null | A solution to the benchmark ATT48 Traveling Salesman Problem (from the
TSPLIB95 library) results from isolating the set of vertices into ten
open-ended zones with nine lengthwise boundaries. In each zone, a
minimum-length Hamiltonian Path (HP) is found for each combination of boundary
vertices, leading to an approxim... | [
{
"version": "v1",
"created": "Tue, 2 Oct 2007 14:26:33 GMT"
}
] | 2007-10-03T00:00:00 | [
[
"Ruffa",
"Anthony A.",
""
]
] |
0710.1001 | Vitaliy Kurlin | V. Kurlin, L. Mihaylova | Connectivity of Random 1-Dimensional Networks | 12 pages, 10 figures | null | null | null | cs.IT cs.DS math.IT stat.AP | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | An important problem in wireless sensor networks is to find the minimal
number of randomly deployed sensors making a network connected with a given
probability. In practice sensors are often deployed one by one along a
trajectory of a vehicle, so it is natural to assume that arbitrary probability
density functions of... | [
{
"version": "v1",
"created": "Thu, 4 Oct 2007 12:57:34 GMT"
},
{
"version": "v2",
"created": "Fri, 9 Oct 2009 21:01:10 GMT"
}
] | 2009-10-10T00:00:00 | [
[
"Kurlin",
"V.",
""
],
[
"Mihaylova",
"L.",
""
]
] |
0710.1435 | Michael Mahoney | Petros Drineas, Michael W. Mahoney, S. Muthukrishnan, and Tamas Sarlos | Faster Least Squares Approximation | 25 pages; minor changes from previous version; this version will
appear in Numerische Mathematik | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Least squares approximation is a technique to find an approximate solution to
a system of linear equations that has no exact solution. In a typical setting,
one lets $n$ be the number of constraints and $d$ be the number of variables,
with $n \gg d$. Then, existing exact methods find a solution vector in
$O(nd^2)$ ti... | [
{
"version": "v1",
"created": "Sun, 7 Oct 2007 17:37:37 GMT"
},
{
"version": "v2",
"created": "Mon, 25 May 2009 23:01:43 GMT"
},
{
"version": "v3",
"created": "Mon, 3 May 2010 06:55:54 GMT"
},
{
"version": "v4",
"created": "Sun, 26 Sep 2010 18:36:00 GMT"
}
] | 2010-09-28T00:00:00 | [
[
"Drineas",
"Petros",
""
],
[
"Mahoney",
"Michael W.",
""
],
[
"Muthukrishnan",
"S.",
""
],
[
"Sarlos",
"Tamas",
""
]
] |
0710.1525 | Sebastiano Vigna | Sebastiano Vigna, Paolo Boldi | Efficient Optimally Lazy Algorithms for Minimal-Interval Semantics | 24 pages, 4 figures. A preliminary (now outdated) version was
presented at SPIRE 2006 | null | null | null | cs.DS cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Minimal-interval semantics associates with each query over a document a set
of intervals, called witnesses, that are incomparable with respect to inclusion
(i.e., they form an antichain): witnesses define the minimal regions of the
document satisfying the query. Minimal-interval semantics makes it easy to
define and ... | [
{
"version": "v1",
"created": "Mon, 8 Oct 2007 12:15:48 GMT"
},
{
"version": "v2",
"created": "Thu, 11 Aug 2016 08:57:30 GMT"
}
] | 2016-08-12T00:00:00 | [
[
"Vigna",
"Sebastiano",
""
],
[
"Boldi",
"Paolo",
""
]
] |
0710.1842 | Frank Ruskey | Frank Ruskey and Aaron Williams | An explicit universal cycle for the (n-1)-permutations of an n-set | null | null | null | null | cs.DM cs.DS | null | We show how to construct an explicit Hamilton cycle in the directed Cayley
graph Cay({\sigma_n, sigma_{n-1}} : \mathbb{S}_n), where \sigma_k = (1 2 >...
k). The existence of such cycles was shown by Jackson (Discrete Mathematics,
149 (1996) 123-129) but the proof only shows that a certain directed graph is
Eulerian, ... | [
{
"version": "v1",
"created": "Tue, 9 Oct 2007 18:06:05 GMT"
}
] | 2007-10-10T00:00:00 | [
[
"Ruskey",
"Frank",
""
],
[
"Williams",
"Aaron",
""
]
] |
0710.2532 | Maxwell Young | Valerie King, Cynthia Phillips, Jared Saia and Maxwell Young | Sleeping on the Job: Energy-Efficient Broadcast for Radio Networks | 15 pages, 1 figure | null | null | null | cs.DS | null | We address the problem of minimizing power consumption when performing
reliable broadcast on a radio network under the following popular model. Each
node in the network is located on a point in a two dimensional grid, and
whenever a node sends a message, all awake nodes within distance r receive the
message. In the b... | [
{
"version": "v1",
"created": "Fri, 12 Oct 2007 19:56:45 GMT"
}
] | 2007-10-15T00:00:00 | [
[
"King",
"Valerie",
""
],
[
"Phillips",
"Cynthia",
""
],
[
"Saia",
"Jared",
""
],
[
"Young",
"Maxwell",
""
]
] |
0710.3246 | John Talbot | David Talbot and John Talbot | Bloom maps | 15 pages | null | null | null | cs.DS cs.IT math.IT | null | We consider the problem of succinctly encoding a static map to support
approximate queries. We derive upper and lower bounds on the space requirements
in terms of the error rate and the entropy of the distribution of values over
keys: our bounds differ by a factor log e. For the upper bound we introduce a
novel data ... | [
{
"version": "v1",
"created": "Wed, 17 Oct 2007 09:35:14 GMT"
}
] | 2007-10-18T00:00:00 | [
[
"Talbot",
"David",
""
],
[
"Talbot",
"John",
""
]
] |
0710.3603 | Jakub Mare\v{c}ek | Edmund K. Burke, Jakub Marecek, Andrew J. Parkes, and Hana Rudova | On a Clique-Based Integer Programming Formulation of Vertex Colouring
with Applications in Course Timetabling | null | Annals of Operations Research (2010) 179(1), 105-130 | 10.1007/s10479-010-0716-z | null | cs.DM cs.DS math.CO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Vertex colouring is a well-known problem in combinatorial optimisation, whose
alternative integer programming formulations have recently attracted
considerable attention. This paper briefly surveys seven known formulations of
vertex colouring and introduces a formulation of vertex colouring using a
suitable clique pa... | [
{
"version": "v1",
"created": "Thu, 18 Oct 2007 21:38:37 GMT"
},
{
"version": "v2",
"created": "Sat, 10 Nov 2007 19:03:39 GMT"
},
{
"version": "v3",
"created": "Tue, 7 Jul 2009 19:55:23 GMT"
}
] | 2014-04-10T00:00:00 | [
[
"Burke",
"Edmund K.",
""
],
[
"Marecek",
"Jakub",
""
],
[
"Parkes",
"Andrew J.",
""
],
[
"Rudova",
"Hana",
""
]
] |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 4