Sciweavers

594 search results - page 103 / 119
» A Note on Concepts and Distances
Sort
View
ASPDAC
2001
ACM
103views Hardware» more  ASPDAC 2001»
13 years 11 months ago
Efficient minimum spanning tree construction without Delaunay triangulation
Given n points in a plane, a minimum spanning tree is a set of edges which connects all the points and has a minimum total length. A naive approach enumerates edges on all pairs o...
Hai Zhou, Narendra V. Shenoy, William Nicholls
CGI
2000
IEEE
13 years 11 months ago
Local and Global Geometric Methods for Analysis Interrogation, Reconstruction, Modification and Design of Shape
This paper gives an overview of some recent methods useful for local and global shape analysis and for the design of solids. These methods include as new tools for global and loca...
Franz-Erich Wolter, K.-I. Friese
IDMS
2000
Springer
131views Multimedia» more  IDMS 2000»
13 years 11 months ago
Spatially Aware Local Communication in the RAUM System
In this paper, we propose a new paradigm for local communication between devices in Ubiquitous Computing environments, assuming a multitude of computerized everyday appliances comm...
Felix Hupfeld, Michael Beigl
KDD
1995
ACM
135views Data Mining» more  KDD 1995»
13 years 11 months ago
Rough Sets Similarity-Based Learning from Databases
Manydata mining algorithms developed recently are based on inductive learning methods. Very few are based on similarity-based learning. However, similarity-based learning accrues ...
Xiaohua Hu, Nick Cercone
VISUALIZATION
1997
IEEE
13 years 11 months ago
Controlled simplification of genus for polygonal models
Genus-reducing simplifications are important in constructing multiresolution hierarchies for level-of-detail-based rendering, especially for datasets that have several relatively ...
Jihad El-Sana, Amitabh Varshney