3096 search results - page 299 / 620 » The Generalized FITC Approximation |
182
click to vote
WWW
2005
ACM
16 years 7 months ago
2005
ACM
We exploit the recently proposed Concept Abduction inference service in Description Logics to solve Concept Covering problems. We propose a framework and polynomial greedy algorit...
172
click to vote
SAC
2009
ACM
16 years 1 months ago
2009
ACM
We present a GPU-based algorithm for computing discretized distance functions on road networks. As applications, we provide algorithms for computing discrete Order-k Network Voron...
147
click to vote
GLOBECOM
2009
IEEE
16 years 1 months ago
2009
IEEE
—This paper investigates the network performance loss of using only single-path routing when multiple paths are available. The performance metric is the aggregate utility achieve...
135
click to vote
IWANN
2009
Springer
16 years 1 months ago
2009
Springer
We present an evolving neural network model in which synapses appear and disappear stochastically according to bio-inspired probabilities. These are in general nonlinear functions ...
150
click to vote
COMPGEOM
2009
ACM
16 years 1 months ago
2009
ACM
It was shown in [11] that any orientable graph of genus g can be probabilistically embedded into a graph of genus g − 1 with constant distortion. Removing handles one by one giv...