1709 search results - page 249 / 342 » Comparing the Performance of Database Selection Algorithms |
144
click to vote
CVPR
2005
IEEE
16 years 7 months ago
2005
IEEE
We propose using the inner-distance between landmark points to build shape descriptors. The inner-distance is defined as the length of the shortest path between landmark points wi...
224
click to vote
ICDE
1998
IEEE
16 years 6 months ago
1998
IEEE
In this paper, we consider a distributed video server environment where video movies need not be stored entirely in one server. Blocks of a video movie are allowed to be distribut...
171
click to vote
SIGMOD
2004
ACM
16 years 5 months ago
2004
ACM
The detection of correlations between different features in a set of feature vectors is a very important data mining task because correlation indicates a dependency between the fe...
177
Voted
DASFAA
2007
IEEE
15 years 11 months ago
2007
IEEE
Subspace clustering (also called projected clustering) addresses the problem that different sets of attributes may be relevant for different clusters in high dimensional feature sp...
111
Voted
FCCM
2007
IEEE
15 years 11 months ago
2007
IEEE
BLASTP is the most popular tool to perform comparative sequence analysis of protein sequences. An exponential increase in the size of protein sequence databases in recent years, h...