Sciweavers

19320 search results - page 61 / 3864
» On the complexity of computing determinants
Sort
View
WG
2004
Springer
15 years 3 months ago
Computing Bounded-Degree Phylogenetic Roots of Disconnected Graphs
The Phylogenetic kth Root Problem (PRk) is the problem of finding a (phylogenetic) tree T from a given graph G = (V, E) such that (1) T has no degree-2 internal nodes, (2) the ex...
Zhi-Zhong Chen, Tatsuie Tsukiji
HAPTICS
2002
IEEE
15 years 2 months ago
Six-Degree-of-Freedom Haptic Display Using Localized Contact Computations
: We present a six-degree-of-freedom haptic rendering algorithm using localized contact computations. It takes advantage of high motion coherence due to fast force update and spati...
Young J. Kim, Miguel A. Otaduy, Ming C. Lin, Dines...
SISAP
2010
IEEE
243views Data Mining» more  SISAP 2010»
14 years 7 months ago
Similarity matrix compression for efficient signature quadratic form distance computation
Determining similarities among multimedia objects is a fundamental task in many content-based retrieval, analysis, mining, and exploration applications. Among state-of-the-art sim...
Christian Beecks, Merih Seran Uysal, Thomas Seidl
ICDAR
2005
IEEE
15 years 3 months ago
Optimized XY-Cut for Determining a Page Reading Order
In this paper, we propose a fast method for determining the human reading order of the layout elements of a document page. The proposal includes a computationally tractable optimi...
Jean-Luc Meunier
ICNC
2005
Springer
15 years 3 months ago
Double Robustness Analysis for Determining Optimal Feedforward Neural Network Architecture
This paper incorporates robustness into neural network modeling and proposes a novel two-phase robustness analysis approach for determining the optimal feedforward neural network (...
Lean Yu, Kin Keung Lai, Shouyang Wang