Sciweavers

2657 search results - page 116 / 532
» On the complexity of hierarchical problem solving
Sort
View
MICCAI
2010
Springer
14 years 11 months ago
Groupwise Registration by Hierarchical Anatomical Correspondence Detection
Groupwise registration has been widely investigated in recent years due to its importance in analyzing population data in many clinical applications. To our best knowledge, most o...
Guorong Wu, Qian Wang, Hongjun Jia, Dinggang Shen
ISSAC
2004
Springer
135views Mathematics» more  ISSAC 2004»
15 years 7 months ago
Absolute polynomial factorization in two variables and the knapsack problem
A recent algorithmic procedure for computing the absolute factorization of a polynomial P(X, Y ), after a linear change of coordinates, is via a factorization modulo X3 . This was...
Guillaume Chèze
CORR
2010
Springer
163views Education» more  CORR 2010»
14 years 10 months ago
NP-hardness of Deciding Convexity of Quartic Polynomials and Related Problems
We show that unless P=NP, there exists no polynomial time (or even pseudo-polynomial time) algorithm that can decide whether a multivariate polynomial of degree four (or higher ev...
Amir Ali Ahmadi, Alexander Olshevsky, Pablo A. Par...
113
Voted
KDD
2004
ACM
285views Data Mining» more  KDD 2004»
15 years 7 months ago
Effective localized regression for damage detection in large complex mechanical structures
In this paper, we propose a novel data mining technique for the efficient damage detection within the large-scale complex mechanical structures. Every mechanical structure is defi...
Aleksandar Lazarevic, Ramdev Kanapady, Chandrika K...
BMCBI
2006
122views more  BMCBI 2006»
15 years 1 months ago
A domain-oriented approach to the reduction of combinatorial complexity in signal transduction networks
Background:Receptors and scaffold proteins possess a number of distinct domains and bind multiple partners. A common problem in modeling signaling systems arises from a combinator...
Holger Conzelmann, Julio Saez-Rodriguez, Thomas Sa...