103 search results - page 20 / 21 » Direct Algorithms for Computing the Transitive Closure of Da... |
CVPR
2000
IEEE
14 years 7 months ago
2000
IEEE
Many visual matching algorithms can be described in terms of the features and the inter-feature distance or metric. The most commonly used metric is the sum of squared di erences ...
PPOPP
2010
ACM
14 years 2 months ago
2010
ACM
Effective data placement strategies can enhance the performance of data-intensive applications implemented on high end computing clusters. Such strategies can have a significant i...
VLDB
2004
ACM
13 years 11 months ago
2004
ACM
It is well established that bitmap indices are efficient for read-only attributes with low attribute cardinalities. For an attribute with a high cardinality, the size of the bitma...
CIDR
2003
13 years 7 months ago
2003
Web cache technologies have been developed as an extension of CPU cache, by modifying LRU (Least Recently Used) algorithms. Actually in web cache systems, we can use disks and ter...
ACL
1994
13 years 7 months ago
1994
This paper shows how to formally characterize language learning in a finite parameter space as a Markov structure, hnportant new language learning results follow directly: explici...