Sciweavers

4797 search results - page 96 / 960
» The complexity of partition tasks
Sort
View
ICDM
2007
IEEE
105views Data Mining» more  ICDM 2007»
14 years 4 months ago
Fast Mining of Complex Spatial Co-location Patterns Using GLIMIT
Most algorithms for mining interesting spatial colocations integrate the co-location / clique generation task with the interesting pattern mining task, and are usually based on th...
Florian Verhein, Ghazi Al-Naymat
ESWA
2007
127views more  ESWA 2007»
13 years 10 months ago
Clustering support vector machines for protein local structure prediction
Understanding the sequence-to-structure relationship is a central task in bioinformatics research. Adequate knowledge about this relationship can potentially improve accuracy for ...
Wei Zhong, Jieyue He, Robert W. Harrison, Phang C....
CORR
1998
Springer
117views Education» more  CORR 1998»
13 years 9 months ago
A Human - machine interface for teleoperation of arm manipulators in a complex environment
This paper discusses the feasibility of using conguration space C-space as a means of visualization and control in operator-guided real-time motion of a robot arm manipulator. T...
Igor Ivanisevic, Vladimir J. Lumelsky
SMI
2005
IEEE
14 years 3 months ago
Volumetric Data Analysis using Morse-Smale Complexes
The 3D Morse-Smale complex is a fundamental topological construct that partitions the domain of a real-valued function into regions having uniform gradient flow behavior. In this...
Vijay Natarajan, Valerio Pascucci
COCOON
2003
Springer
14 years 3 months ago
Matroid Representation of Clique Complexes
In this paper, we approach the quality of a greedy algorithm for the maximum weighted clique problem from the viewpoint of matroid theory. More precisely, we consider the clique c...
Kenji Kashiwabara, Yoshio Okamoto, Takeaki Uno