5092 search results - page 237 / 1019 » Clustering the Feature Space |
198
click to vote
NIPS
2007
15 years 8 months ago
2007
Clustering is often formulated as a discrete optimization problem. The objective is to find, among all partitions of the data set, the best one according to some quality measure....
246
click to vote
DEXAW
2010
IEEE
15 years 8 months ago
2010
IEEE
Automatic generation of taxonomies can be useful for a wide area of applications. In our application scenario a topical hierarchy should be constructed reasonably fast from a large...
185
click to vote
IEEEHPCS
2010
15 years 5 months ago
2010
Hardware accelerators are becoming a highly appealing approach to boost the raw performance as well as the price-performance and power-performance ratios of current clusters. In t...
220
click to vote
MM
2009
ACM
16 years 1 months ago
2009
ACM
This paper presents a novel motion localization approach for recognizing actions and events in real videos. Examples include StandUp and Kiss in Hollywood movies. The challenge ca...
197
click to vote
DKE
1998
15 years 6 months ago
1998
Disk I/O is a major bottleneck for query processing in database applications. This bottleneck is especially a problem for temporal databases because of their large size. Reduction...