Sciweavers

4961 search results - page 523 / 993
» Homomorphism-Homogeneous Relational Structures
Sort
View
PAMI
2011
15 years 1 months ago
Greedy Learning of Binary Latent Trees
—Inferring latent structures from observations helps to model and possibly also understand underlying data generating processes. A rich class of latent structures are the latent ...
Stefan Harmeling, Christopher K. I. Williams
COMPGEOM
2006
ACM
15 years 8 months ago
On the ICP algorithm
We present upper and lower bounds for the number of iterations performed by the Iterative Closest Point (ICP) algorithm. This algorithm has been proposed by Besl and McKay [4] as ...
Esther Ezra, Micha Sharir, Alon Efrat
SIROCCO
2008
15 years 8 months ago
Sharpness: A Tight Condition for Scalability
: A distributed system is scalable if the rate at which it completes its computation and communication tasks does not depend on its size. As an example, the scalability of a peer-t...
Augustin Chaintreau
IJCAI
2003
15 years 8 months ago
Hierarchical Hidden Markov Models for Information Extraction
Information extraction can be defined as the task of automatically extracting instances of specified classes or relations from text. We consider the case of using machine learni...
Marios Skounakis, Mark Craven, Soumya Ray
CSL
2010
Springer
15 years 8 months ago
On the Computability of Region-Based Euclidean Logics
By a Euclidean logic, we understand a formal language whose variables range over subsets of Euclidean space, of some fixed dimension, and whose non-logical primitives have fixed me...
Yavor Nenov, Ian Pratt-Hartmann