2880 search results - page 153 / 576 » Approximate Range Searching |
132
click to vote
ISMIS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. A multi-relational clustering method is presented which can be applied to complex knowledge bases storing resources expressed in the standard Semantic Web languages. It a...
141
Voted
PLDI
2003
ACM
15 years 8 months ago
2003
ACM
Compiler writers have crafted many heuristics over the years to approximately solve NP-hard problems efficiently. Finding a heuristic that performs well on a broad range of applic...
114
Voted
SIGIR
1999
ACM
15 years 7 months ago
1999
ACM
Abstract We compare the performance of two database selection algorithms reported in the literature. Their performance is compared using a common testbed designed specifically for ...
199
Voted
SBBD
2008
15 years 5 months ago
2008
A perfect hash function (PHF) is an injective function that maps keys from a set S to unique values, which are in turn used to index a hash table. Since no collisions occur, each k...
149
Voted
PR
2008
15 years 3 months ago
2008
We present an efficient and robust method of locating a set of feature points in an object of interest. From a training set we construct a joint model of the appearance of each fe...