3096 search results - page 410 / 620 » The Generalized FITC Approximation |
172
click to vote
CVPR
1999
IEEE
15 years 10 months ago
1999
IEEE
We introduce an approach to feature-based object recognition, using maximum a posteriori (MAP) estimation under a Markov random field (MRF) model. This approach provides an effici...
157
click to vote
CPM
1999
Springer
15 years 10 months ago
1999
Springer
We focus on the combinatorial analysis of physical mapping with repeated probes. We present computational complexity results, and we describe and analyze an algorithmic strategy. W...
172
click to vote
SIGMOD
1998
ACM
15 years 10 months ago
1998
ACM
Semistructured data is characterized by the lack of any fixed and rigid schema, although typically the data hassomeimplicitstructure. While thelack offixedschemamakesextracting ...
160
click to vote
ECML
1993
Springer
15 years 10 months ago
1993
Springer
In machine learning theory, problem classes are distinguished because of di erences in complexity. In 6 , a stochastic model of learning from examples was introduced. This PAClear...
162
click to vote
ATAL
2006
Springer
15 years 10 months ago
2006
Springer
The ability to coordinate effectively is critical for agents to accomplish their goals in a multi-agent system. A number of researchers have modeled the coordination problem for m...