Sciweavers

7123 search results - page 105 / 1425
» The Ordered Set of Rough Sets
Sort
View
SIGMETRICS
2000
ACM
101views Hardware» more  SIGMETRICS 2000»
14 years 2 months ago
Feasibility of a serverless distributed file system deployed on an existing set of desktop PCs
We consider an architecture for a serverless distributed file system that does not assume mutual trust among the client computers. The system provides security, availability, and ...
William J. Bolosky, John R. Douceur, David Ely, Ma...
COMPGEOM
2001
ACM
14 years 1 months ago
Segment intersection searching problems in general settings
We consider segment intersection searching amidst (possibly intersecting) algebraic arcs in the plane. We show how to preprocess n arcs in time O(n2+ ) into a data structure of si...
Vladlen Koltun
FIMI
2003
170views Data Mining» more  FIMI 2003»
13 years 11 months ago
kDCI: a Multi-Strategy Algorithm for Mining Frequent Sets
This paper presents the implementation of kDCI, an enhancement of DCI [10], a scalable algorithm for discovering frequent sets in large databases. The main contribution of kDCI re...
Salvatore Orlando, Claudio Lucchese, Paolo Palmeri...
SMA
2008
ACM
154views Solid Modeling» more  SMA 2008»
13 years 10 months ago
Solid height-map sets: modeling and visualization
Height maps are a very efficient surface representation, initially developed for terrain modeling and visualization. They are also present in other applications, such as mesostruc...
Paulo I. N. Santos, Rodrigo de Toledo, Marcelo Gat...
IJISTA
2007
136views more  IJISTA 2007»
13 years 9 months ago
Optimisation-on-a-manifold for global registration of multiple 3D point sets
: We propose a novel algorithm to register multiple 3D point sets within a common reference frame simultaneously. Our approach performs an explicit optimisation on the manifold of ...
Shankar Krishnan, Pei Yean Lee, John B. Moore, Sur...