804 search results - page 79 / 161 » Experiments on Union-Find Algorithms for the Disjoint-Set Da... |
CVPR
2011
IEEE
13 years 4 months ago
2011
IEEE
A convenient way of dealing with image sets is to represent them as points on Grassmannian manifolds. While several recent studies explored the applicability of discriminant analy...
EUROSYS
2011
ACM
12 years 11 months ago
2011
ACM
Parallel software is increasingly necessary to take advantage of multi-core architectures, but it is also prone to concurrency bugs which are particularly hard to avoid, find, an...
NIPS
2001
13 years 9 months ago
2001
Unsupervised learning algorithms have been derived for several statistical models of English grammar, but their computational complexity makes applying them to large data sets int...
CSB
2005
IEEE
14 years 1 months ago
2005
IEEE
Microarray experiments are characterized by a massive amount of data, usually in the form of an image. Based on the nature of microarray images, we consider the microarray in term...
ICDM
2003
IEEE
14 years 1 months ago
2003
IEEE
Tree structures are used extensively in domains such as computational biology, pattern recognition, computer networks, and so on. In this paper, we present an indexing technique f...