736 search results - page 115 / 148 » A dynamic data structure for approximate range searching |
ICCD
2006
IEEE
14 years 5 months ago
2006
IEEE
Pointer bugs associated with dynamically-allocated objects resulting in out-of-bounds memory access are an important class of software bugs. Because such bugs cannot be detected e...
SDM
2007
SIAM
13 years 10 months ago
2007
SIAM
The problem of efficiently finding images that are similar to a target image has attracted much attention in the image processing community and is rightly considered an informatio...
UAI
2001
13 years 10 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...
NN
2002
Springer
13 years 8 months ago
2002
Springer
The ability to grow extra nodes is a potentially useful facility for a self-organising neural network. A network that can add nodes into its map space can approximate the input sp...
CIKM
2005
Springer
14 years 2 months ago
2005
Springer
Peer-to-peer (p2p) systems offer an efficient means of data sharing among a dynamically changing set of a large number of autonomous nodes. Each node in a p2p system is connected...