Sciweavers

22 search results - page 4 / 5
» Computational Structure in Three-Valued Nearness Relations
Sort
View
EJC
2008
13 years 9 months ago
Center Fragments for Upscaling and Verification in Database Semantics
The notion of a fragment was coined by Montague 1974 to illustrate the formal handling of certain puzzles, such as de dicto/de re, in a truth-conditional semantics for natural lan...
Roland Hausser
3DIM
2007
IEEE
14 years 1 months ago
Cached k-d tree search for ICP algorithms
The ICP (Iterative Closest Point) algorithm is the de facto standard for geometric alignment of threedimensional models when an initial relative pose estimate is available. The ba...
Andreas Nüchter, Kai Lingemann, Joachim Hertz...
BMCBI
2007
116views more  BMCBI 2007»
13 years 7 months ago
MED: a new non-supervised gene prediction algorithm for bacterial and archaeal genomes
Background: Despite a remarkable success in the computational prediction of genes in Bacteria and Archaea, a lack of comprehensive understanding of prokaryotic gene structures pre...
Huaiqiu Zhu, Gang-Qing Hu, Yi-Fan Yang, Jin Wang, ...
SI3D
2003
ACM
14 years 22 days ago
Perceptually guided simplification of lit, textured meshes
We present a new algorithm for best-effort simplification of polygonal meshes based on principles of visual perception. Building on previous work, we use a simple model of low-lev...
Nathaniel Williams, David P. Luebke, Jonathan D. C...
CHI
2002
ACM
14 years 7 months ago
Workshop: Creating and refining knowledges, identities, and understandings in on-line communities
This two-day workshop examines the ways that on-line communities create and refine their shared resources, including both the formal and observable artifacts (documents, chats, th...
Michael J. Muller, David R. Millen