Sciweavers

4536 search results - page 121 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
100
Voted
ICPR
2002
IEEE
15 years 7 months ago
Exploratory Analysis of Point Proximity in Subspaces
We consider clustering as computation of a structure of proximity relationships within a data set in a feature space or its subspaces. We propose a data structure to represent suc...
Tin Kam Ho
119
Voted
IJBRA
2007
80views more  IJBRA 2007»
15 years 2 months ago
On predicting secondary structure transition
A function of a protein is dependent on its structure; therefore, predicting a protein structure from an amino acid sequence is an active area of research. Optimally predicting a ...
Raja Loganantharaj, Vivek Philip
127
Voted
ICDM
2009
IEEE
167views Data Mining» more  ICDM 2009»
14 years 12 months ago
Self-Adaptive Anytime Stream Clustering
Clustering streaming data requires algorithms which are capable of updating clustering results for the incoming data. As data is constantly arriving, time for processing is limited...
Philipp Kranen, Ira Assent, Corinna Baldauf, Thoma...
123
Voted
VLDB
1994
ACM
152views Database» more  VLDB 1994»
15 years 6 months ago
The GMAP: A Versatile Tool for Physical Data Independence
Physical data independence is touted as a central feature of modern database systems. Both relational and object-oriented systems, however, force users to frame their queries in t...
Odysseas G. Tsatalos, Marvin H. Solomon, Yannis E....
94
Voted
MDAI
2007
Springer
15 years 8 months ago
Lindig's Algorithm for Concept Lattices over Graded Attributes
Formal concept analysis (FCA) is a method of exploratory data analysis. The data is in the form of a table describing relationship between objects (rows) and attributes (columns), ...
Radim Belohlávek, Bernard De Baets, Jan Out...