Sciweavers

562 search results - page 30 / 113
» An Analysis of Transformational Analogy: General Framework a...
Sort
View
CP
1998
Springer
14 years 21 days ago
A Framework for Assertion-Based Debugging in Constraint Logic Programming
Abstract. We propose a general framework for assertion-based debugging of constraint logic programs. Assertions are linguistic constructions which allow expressing properties of pr...
Germán Puebla, Francisco Bueno, Manuel V. H...
TNN
2008
102views more  TNN 2008»
13 years 8 months ago
A Class of Complex ICA Algorithms Based on the Kurtosis Cost Function
In this paper, we introduce a novel way of performing real-valued optimization in the complex domain. This framework enables a direct complex optimization technique when the cost f...
Hualiang Li, Tülay Adali
CVIU
2007
193views more  CVIU 2007»
13 years 8 months ago
Interpretation of complex scenes using dynamic tree-structure Bayesian networks
This paper addresses the problem of object detection and recognition in complex scenes, where objects are partially occluded. The approach presented herein is based on the hypothe...
Sinisa Todorovic, Michael C. Nechyba
AI
2006
Springer
13 years 8 months ago
The complexity of soft constraint satisfaction
Over the past few years there has been considerable progress in methods to systematically analyse the complexity of constraint satisfaction problems with specified constraint type...
David A. Cohen, Martin C. Cooper, Peter Jeavons, A...
JALC
2002
97views more  JALC 2002»
13 years 8 months ago
Semiring Frameworks and Algorithms for Shortest-Distance Problems
We define general algebraic frameworks for shortest-distance problems based on the structure of semirings. We give a generic algorithm for finding single-source shortest distances...
Mehryar Mohri