Sciweavers

3168 search results - page 389 / 634
» Neutrosophic Relational Data Model
Sort
View
ISAAC
2009
Springer
101views Algorithms» more  ISAAC 2009»
16 years 1 months ago
Maintaining Nets and Net Trees under Incremental Motion
The problem of maintaining geometric structures for points in motion has been well studied over the years. Much theoretical work to date has been based on the assumption that point...
Minkyoung Cho, David M. Mount, Eunhui Park
JCDL
2009
ACM
102views Education» more  JCDL 2009»
16 years 1 months ago
Unsupervised creation of small world networks for the preservation of digital objects
The prevailing model for digital preservation is that archives should be similar to a “fortress”: a large, protective infrastructure built to defend a relatively small collect...
Charles L. Cartledge, Michael L. Nelson
3DIM
2007
IEEE
16 years 1 months ago
A Comparative Analysis of Depth-Discontinuity and Mixed-Pixel Detection Algorithms
Laser scanner measurements are corrupted by noise and artifacts that can undermine the performance of registration, segmentation, surface reconstruction, recognition, and other al...
Pingbo Tang, Daniel Huber, Burcu Akinci
CONTEXT
2007
Springer
16 years 1 months ago
A Qualitative Look at Eye-tracking for Implicit Relevance Feedback
Our goal in this study was to explore the potentials of extracting features from eye-tracking data that have the potential to improve performance in implicit relevance feedback. We...
Kirsten Kirkegaard Moe, Jeanette M. Jensen, Birger...
COCOON
2005
Springer
16 years 11 days ago
Perfect Sorting by Reversals
In computational biology, gene order data is often modelled as signed permutations. A classical problem in genome comparison is to detect conserved segments in a permutation, that ...
Marie-France Sagot, Eric Tannier