3837 search results - page 107 / 768 » Learning Approximate Consistencies |
179
click to vote
EDBT
2006
ACM
15 years 8 months ago
2006
ACM
Utilizing spatial index structures on secondary memory for nearest neighbor search in high-dimensional data spaces has been the subject of much research. With the potential to host...
137
click to vote
ESA
2006
Springer
15 years 8 months ago
2006
Springer
An instance of the generalized partial cover problem consists of a ground set U and a family of subsets S 2U . Each element e U is associated with a profit p(e), whereas each su...
151
click to vote
UAI
2001
15 years 5 months ago
2001
This paper presents a new deterministic approximation technique in Bayesian networks. This method, "Expectation Propagation," unifies two previous techniques: assumed-de...
141
click to vote
ALMOB
2006
15 years 4 months ago
2006
The String Barcoding (SBC) problem, introduced by Rash and Gusfield (RECOMB, 2002), consists in finding a minimum set of substrings that can be used to distinguish between all mem...
140
click to vote
CGF
2002
15 years 4 months ago
2002
We extend the standard solution to comic rendering with a comic-style specular component. To minimise the computational overhead associated with this extension, we introduce two o...