2286 search results - page 91 / 458 » Algorithms for Categorical Equivalence |
118
click to vote
ISAAC
2003
Springer
15 years 11 months ago
2003
Springer
Given k sorted arrays, the t-Threshold problem, which is motivated by indexed search engines, consists of finding the elements which are present in at least t of the arrays. We pr...
146
click to vote
ACL
2006
15 years 7 months ago
2006
We present an efficient algorithm for the redundancy elimination problem: Given an underspecified semantic representation (USR) of a scope ambiguity, compute an USR with fewer mut...
175
click to vote
DAM
2006
15 years 5 months ago
2006
There are many randomized "divide and conquer" algorithms, such as randomized Quicksort, whose operation involves partitioning a problem of size n uniformly at random int...
143
click to vote
IPL
2007
15 years 5 months ago
2007
In this work we consider hierarchical clustering algorithms, such as UPGMA, which follow the closest-pair joining scheme. We survey optimal O(n2)-time implementations of such algo...
151
click to vote
ICIAP
2007
ACM
16 years 6 months ago
2007
ACM
The well-known marching cubes algorithm is modified to apply to the face-centered cubic (fcc) grid. Thus, the local configurations that are considered when extracting the local su...