Sciweavers

6562 search results - page 99 / 1313
» Noetherianity and Combination Problems
Sort
View
155
Voted
CVPR
2009
IEEE
16 years 11 months ago
Epitomized Priors for Multi-labeling Problems
Image parsing remains difficult due to the need to combine local and contextual information when labeling a scene. We approach this problem by using the epitome as a prior over ...
Jonathan Warrell, Simon J. D. Prince, Alastair P. ...
ICIP
1998
IEEE
16 years 6 months ago
An Explicit Closed-Form Solution to the Limited-Angle Discrete Tomography Problem for Finite-Support Objects
: An explicit formula is presented for reconstructing a This article derives an explicit formula for the integer values finite-support object defined on a lattice of points and tak...
Andrew E. Yagle
134
Voted
HICSS
1994
IEEE
118views Biometrics» more  HICSS 1994»
15 years 8 months ago
A Distributed Architecture for an Instructable Problem Solver
Our research goal is to design systems that enable humans to teach tedious, repetitive, simple tasks to a computer. We propose here a learner/problem solver architecture for such ...
Jacky Baltes, Bruce A. MacDonald
IJCSA
2007
104views more  IJCSA 2007»
15 years 4 months ago
Solving the Satisfiability Problem Using Finite Learning Automata
A large number of problems that occur in knowledge-representation, learning, VLSI-design, and other areas of artificial intelligence, are essentially satisfiability problems. The ...
Ole-Christoffer Granmo, Noureddine Bouhmala
TIME
1998
IEEE
15 years 8 months ago
Tackling the Qualification Problem using Fluent Dependency Constraints: Preliminary Report
The use of causal rules or fluent dependency constraints has proven to provide a versatile means of dealing with the ramification problem. In this paper we show how fluent depende...
Patrick Doherty, Jonas Kvarnström