Suchergebnisse - Exact construction algorithm with cubic complexity*

Kernel bounds for disjoint cycles and disjoint paths von Bodlaender, Hans L., Thomassé, Stéphan, Yeo, Anders

“… In this paper, we show that the problems Disjoint Cycles and Disjoint Paths do not have polynomial kernels, unless N P ⊆ c o N P / p o l y . Thus, these …”
Volltext

Low ML Decoding Complexity STBCs via Codes Over the Klein Group von Natarajan, L. P., Rajan, B. S.

“… New full-diversity STBCs with low ML decoding complexity and cubic shaping property are constructed, via codes over K , for number of transmit antennas N =2 m , m ≥ 1, and rates R …”
Volltext

SISO APP Searches in Lattices With Tanner Graphs von Ionescu, D. M., Haidong Zhu

“… An efficient, low-complexity, soft-output detector for general lattices is presented, based on their Tanner graph (TG) representations …”
Volltext

Realizable Spatio-Temporal Tomlinson-Harashima Precoders: Theory and Fast Computation von Wahls, S., Boche, H.

“… We derive the optimal realizable Tomlinson-Harashima precoder for frequency-selective multiple-input multiple-output (MIMO) channels with respect to a …”
Volltext

Semi-Supervised Learning with Close-Form Label Propagation Using a Bipartite Graph von Peng, Zhongxing, Zheng, Gengzhong, Huang, Wei

“… In particular, on the one hand, our algorithm computes the label propagation in closed-form, reducing its computational complexity from cubic to approximately …”
Volltext

The Rank-Reduced Kalman Filter: Approximate Dynamical-Low-Rank Filtering In High Dimensions von Schmidt, Jonathan, Hennig, Philipp, Nick, Jörg, Tronarp, Filip

“… Inference and simulation in the context of high-dimensional dynamical systems remain computationally challenging problems. Some form of dimensionality …”
Volltext

Generalization ability of fractional polynomial models von Lei, Yunwen, Ding, Lixin, Ding, Yiming

“… In this paper, the problem of learning the functional dependency between input and output variables from scattered data using fractional polynomial …”
Volltext

Smoothing Splines for Discontinuous Signals von Storath, Martin, Weinmann, Andreas

“… Smoothing splines are twice differentiable by construction, so they cannot capture potential discontinuities in the underlying signal …”
Volltext

Reconciliation of Gene and Species Trees von Rusin, L. Y., Lyubetskaya, E. V., Gorbunov, K. Y., Lyubetsky, Vassily

“… The first part of the paper briefly overviews the problem of gene and species trees reconciliation with the focus on defining and algorithmic construction of the evolutionary scenario …”
Volltext

Smoothing splines for discontinuous signals von Storath, Martin, Weinmann, Andreas

“… Smoothing splines are twice differentiable by construction, so they cannot capture potential discontinuities in the underlying signal …”
Volltext

Construction of the octree approximating three-dimensional objects by using multiple views von NOBORIO, H, FUKUDA, S, ARIMOTO, S

“… The computational complexity of the algorithm is directly proportional to the common region surface area and exponentially proportional to the finest resolution level of the octree. The calculation time of the algorithm is determined for illustrative examples of three-dimensional objects. (I.E.) …”
Volltext

A Framework for Drawing Planar Graphs with Curves and Polylines von Goodrich, Michael T., Wagner, Christopher G.

“… such as vertex and edge representational complexity and the area of the drawing. In addition to this general framework, we present algorithms that operate within this framework …”
Volltext

Graph visualization and network routing von Wagner, Christopher Glen

“… Graph visualization concerns itself with the construction of two- and sometimes three-dimensional representation of graphs, with numerous applications to computer science …”
Volltext