Sciweavers

19320 search results - page 14 / 3864
» On the complexity of computing determinants
Sort
View
111
Voted
BMCBI
2007
138views more  BMCBI 2007»
15 years 14 days ago
A novel Bayesian approach to quantify clinical variables and to determine their spectroscopic counterparts in 1H NMR metabonomic
Background: A key challenge in metabonomics is to uncover quantitative associations between multidimensional spectroscopic data and biochemical measures used for disease risk asse...
Aki Vehtari, Ville-Petteri Mäkinen, Pasi Soin...
FCT
2003
Springer
15 years 5 months ago
On a Logical Approach to Estimating Computational Complexity of Potentially Intractable Problems
Abstract. In the paper we present a purely logical approach to estimating computational complexity of potentially intractable problems. The approach is based on descriptive complex...
Andrzej Szalas
83
Voted
TON
2008
99views more  TON 2008»
15 years 11 days ago
On the computational complexity and effectiveness of N-hub shortest-path routing
Abstract-- In this paper we study the computational complexity and effectiveness of a concept we term "N-hub ShortestPath Routing" in IP networks. N-hub Shortest-Path Rou...
Reuven Cohen, Gabi Nakibly
COSIT
2001
Springer
158views GIS» more  COSIT 2001»
15 years 5 months ago
Double-Crossing: Decidability and Computational Complexity of a Qualitative Calculus for Navigation
Abstract. The Double Cross calculus has been proposed for the purpose of navigation based on qualitative information about spatial configurations. Up until now, however, no result...
Alexander Scivos, Bernhard Nebel
78
Voted
ICPR
2006
IEEE
16 years 1 months ago
Unifying Background Models over Complex Audio using Entropy
In this paper we extend an existing audio background modelling technique, leading to a more robust application to complex audio environments. The determination of background audio...
Geoff A. W. West, Simon Moncrieff, Svetha Venkates...