1399 search results - page 166 / 280 » Multi-party Finite Computations |
146
click to vote
IJCAI
1989
15 years 5 months ago
1989
The foundations of a class of logic programming systems with the expressive power of full first-order logic and a non-monotonic component is addressed. The underlying refutation m...
181
click to vote
NCA
2008
IEEE
15 years 4 months ago
2008
IEEE
The paper focuses on the study of solving the large-scale traveling salesman problem (TSP) based on neurodynamic programming. From this perspective, two methods, temporal differenc...
133
click to vote
CORR
1999
Springer
15 years 4 months ago
1999
Springer
Given a finite set of non-collinear points in the plane, there exists a line that passes through exactly two points. Such a line is called an ordinary line. An efficient algorithm...
136
click to vote
ICCV
2009
IEEE
16 years 9 months ago
2009
IEEE
We present some theoretical results related to the problem
of actively searching for a target in a 3D environment,
under the constraint of a maximum search time. We define
the o...
150
click to vote
CVPR
2004
IEEE
16 years 6 months ago
2004
IEEE
We propose an approach to include contextual features for labeling images, in which each pixel is assigned to one of a finite set of labels. The features are incorporated into a p...