7150 search results - page 1250 / 1430 » An Approximation Algorithm for Approximation Rank |
181
click to vote
IJCAI
2003
15 years 7 months ago
2003
The problem of identifying approximately duplicate objects in databases is an essential step for the information integration process. Most existing approaches have relied on gener...
203
click to vote
UAI
2001
15 years 7 months ago
2001
In this paper we present a method of computing the posterior probability of conditional independence of two or more continuous variables from data, examined at several resolutions...
166
click to vote
STRINGOLOGY
2004
15 years 7 months ago
2004
We investigate the shortest common superstring problem (SCSSP). As SCSSP is APX-complete it cannot be approximated within an arbitrarily small performance ratio. One heuristic tha...
142
click to vote
UAI
2004
15 years 7 months ago
2004
For many real-life Bayesian networks, common knowledge dictates that the output established for the main variable of interest increases with higher values for the observable varia...
199
click to vote
WOB
2004
15 years 7 months ago
2004
ABSTRACT. Reconfigurable systolic arrays can be adapted to efficiently resolve a wide spectrum of computational problems; parallelism is naturally explored in systolic arrays and r...