1957 search results - page 241 / 392 » Approximate algorithms for neural-Bayesian approaches |
101
click to vote
COMPGEOM
2000
ACM
15 years 2 months ago
2000
ACM
: We present a new approach for computing generalized Voronoi diagrams in two and three dimensions using interpolation-based polygon rasterization hardware. The input primitives ma...
ESA
2006
Springer
15 years 1 months ago
2006
Springer
An instance of the path hitting problem consists of two families of paths, D and H, in a common undirected graph, where each path in H is associated with a non-negative cost. We r...
BNCOD
2007
14 years 11 months ago
2007
We present a novel framework for indexing and searching schema-less XML documents based on concise summaries of their structural and textual content. Our search query language is X...
106
click to vote
SDM
2008
SIAM
14 years 11 months ago
2008
SIAM
We describe a fast algorithm for kernel discriminant analysis, empirically demonstrating asymptotic speed-up over the previous best approach. We achieve this with a new pattern of...
106
click to vote
TON
2008
14 years 10 months ago
2008
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...