4039 search results - page 789 / 808 » A Method for Dynamic Clustering of Data |
110
click to vote
ICCV
2007
IEEE
16 years 1 months ago
2007
IEEE
We propose an approach to activity recognition based on detecting and analyzing the sequence of objects that are being manipulated by the user. In domains such as cooking, where m...
103
click to vote
KDD
2007
ACM
16 years 5 days ago
2007
ACM
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
171
click to vote
VLDB
2008
ACM
15 years 12 months ago
2008
ACM
Besides traditional domains (e.g., resource allocation, data mining applications), algorithms for medoid computation and related problems will play an important role in numerous e...
169
click to vote
SIGMOD
2008
ACM
15 years 12 months ago
2008
ACM
Random sampling is an appealing approach to build synopses of large data streams because random samples can be used for a broad spectrum of analytical tasks. Users are often inter...
188
click to vote
SIGMOD
2006
ACM
15 years 12 months ago
2006
ACM
Given a dataset P and a preference function f, a top-k query retrieves the k tuples in P with the highest scores according to f. Even though the problem is well-studied in convent...