Sciweavers

AMC
2016
52views Algorithms» more  AMC 2016»
10 years 1 months ago
On the volume of sets bounded by refinable functions
We present a method for the precise determination of the volume of subsets of Rd which are bounded by a hypersurface parametrized by a set of refinable functions. The derivation i...
Jan Hakenberg, Ulrich Reif


views
56 years 4 months ago


views
56 years 4 months ago
AMC
2016
58views Algorithms» more  AMC 2016»
10 years 1 months ago
Some remarks on Wiener index of oriented graphs
Martin Knor 0001, Riste Skrekovski, Aleksandra Tep...
ALGORITHMS
2016
10 years 1 months ago
Co-Clustering under the Maximum Norm
Abstract. Co-clustering, that is, partitioning a matrix into “homogeneous” submatrices, has many applications ranging from bioinformatics to election analysis. Many interesting...
Laurent Bulteau, Vincent Froese, Sepp Hartung, Rol...
156
Voted
ALGORITHMICA
2016
10 years 1 months ago
3SUM, 3XOR, Triangles
Zahra Jafargholi, Emanuele Viola
ALGORITHMICA
2016
10 years 1 months ago
PTAS for Densest k-Subgraph in Interval Graphs
Given an interval graph and integer k, we consider the problem of finding a subgraph of size k with a maximum number of induced edges, called densest k-subgraph problem in interv...
Tim Nonner
ALGORITHMICA
2016
10 years 1 months ago
The Two-Handed Tile Assembly Model is not Intrinsically Universal
Erik D. Demaine, Matthew J. Patitz, Trent A. Roger...