2397 search results - page 32 / 480 » Applications of integer relation algorithms |
SODA
2010
ACM
14 years 8 months ago
2010
ACM
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...
ICDM
2010
IEEE
13 years 9 months ago
2010
IEEE
An important problem that arises during the data mining process in many new emerging application domains is mining data with temporal dependencies. One such application domain is a...
TACAS
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. In this paper we prove that the transitive closure of a nondeterministic octagonal relation using integer counters can be expressed in Presburger arithmetic. The direct c...
ALGORITHMICA
2011
13 years 6 months ago
2011
Let G = (V, E, w) be a directed graph, where w : V → R is an arbitrary weight function defined on its vertices. The bottleneck weight, or the capacity, of a path is the smalles...
CASC
2007
Springer
14 years 5 months ago
2007
Springer
For graphs there exist highly elaborated drawing algorithms. We concentrate here in an analogous way on visualizing relations represented as Boolean matrices as, e.g., in RelView. ...