Sciweavers

184 search results - page 30 / 37
» The Meaning of Logs
Sort
View
COMPGEOM
2006
ACM
13 years 10 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
DOCENG
2008
ACM
13 years 10 months ago
A concise XML binding framework facilitates practical object-oriented document engineering
Semantic web researchers tend to assume that XML Schema and OWL-S are the correct means for representing the types, structure, and semantics of XML data used for documents and int...
Andruid Kerne, Zachary O. Toups, Blake Dworaczyk, ...
NIPS
2008
13 years 9 months ago
Relative Performance Guarantees for Approximate Inference in Latent Dirichlet Allocation
Hierarchical probabilistic modeling of discrete data has emerged as a powerful tool for text analysis. Posterior inference in such models is intractable, and practitioners rely on...
Indraneel Mukherjee, David M. Blei
ACID
2006
236views Algorithms» more  ACID 2006»
13 years 9 months ago
Kernelization for Convex Recoloring
The Convex Recoloring (CR) problem measures how far a tree of characters differs from exhibiting a so-called "perfect phylogeny". For input consisting of a vertex-colored...
Hans L. Bodlaender, Michael R. Fellows, Michael A....
PDPTA
2004
13 years 9 months ago
Static Performance Evaluation for Memory-Bound Computing: The MBRAM Model
We present the MBRAM model for static evaluation of the performance of memory-bound programs. The MBRAM model predicts the actual running time of a memory-bound program directly fr...
Gene Cooperman, Xiaoqin Ma, Viet Ha Nguyen