Sciweavers

1968 search results - page 244 / 394
» The Complexity of Valued Constraint Models
Sort
View
BMCBI
2008
242views more  BMCBI 2008»
15 years 1 months ago
New time-scale criteria for model simplification of bio-reaction systems
Background: Quasi-steady state approximation (QSSA) based on time-scale analysis is known to be an effective method for simplifying metabolic reaction system, but the conventional...
Junwon Choi, Kyung-won Yang, Tai-yong Lee, Sang Yu...
PAMI
2006
227views more  PAMI 2006»
15 years 1 months ago
Matching 2.5D Face Scans to 3D Models
The performance of face recognition systems that use two-dimensional images depends on factors such as lighting and subject's pose. We are developing a face recognition system...
Xiaoguang Lu, Anil K. Jain, Dirk Colbry
CVPR
2006
IEEE
16 years 3 months ago
Multiclass Object Recognition with Sparse, Localized Features
We apply a biologically inspired model of visual object recognition to the multiclass object categorization problem. Our model modifies that of Serre, Wolf, and Poggio. As in that...
Jim Mutch, David G. Lowe
CBSE
2005
Springer
15 years 7 months ago
Performance Prediction of J2EE Applications Using Messaging Protocols
Abstract. Predicting the performance of component-based applications is difficult due to the complexity of the underlying component technology. This problem is exacerbated when a m...
Yan Liu, Ian Gorton
SDM
2010
SIAM
158views Data Mining» more  SDM 2010»
15 years 3 months ago
On the Use of Combining Rules in Relational Probability Trees
A relational probability tree (RPT) is a type of decision tree that can be used for probabilistic classification of instances with a relational structure. Each leaf of an RPT cont...
Daan Fierens