Sciweavers

576 search results - page 59 / 116
» Matching methodology to problem domain
Sort
View
CII
2008
100views more  CII 2008»
13 years 8 months ago
Knowledge formalization in experience feedback processes: An ontology-based approach
Because of the current trend of integration and interoperability of industrial systems, their size and complexity continue to grow making it more difficult to analyze, to understa...
Bernard Kamsu Foguem, Thierry Coudert, C. Bé...
BROADNETS
2006
IEEE
14 years 2 months ago
Minimum Rejection Scheduling in All-Photonic Networks
Internal switches in all-photonic networks do not perform data conversion into the electronic domain, thereby eliminating a potential capacity bottleneck, but the inability to per...
Nahid Saberi, Mark Coates
ICMCS
2005
IEEE
97views Multimedia» more  ICMCS 2005»
14 years 2 months ago
A computationally efficient 3D shape rejection algorithm
In this paper, we present an efficient 3D shape rejection algorithm for unlabeled 3D markers. The problem is important in domains such as rehabilitation and the performing arts. T...
Yinpeng Chen, Hari Sundaram
ICA
2004
Springer
14 years 2 months ago
Soft-LOST: EM on a Mixture of Oriented Lines
Robust clustering of data into overlapping linear subspaces is a common problem. Here we consider one-dimensional subspaces that cross the origin. This problem arises in blind sour...
Paul D. O'Grady, Barak A. Pearlmutter
AAAI
1994
13 years 10 months ago
A Filtering Algorithm for Constraints of Difference in CSPs
Many real-life Constraint Satisfaction Problems (CSPs) involve some constraints similar to the alldifferent constraints. These constraints are called constraints of difference. Th...
Jean-Charles Régin