1283 search results - page 153 / 257 » Probabilistic structured query methods |
MOBIDE
2005
ACM
14 years 2 months ago
2005
ACM
Query processing on mobile sensor networks requires efficient indexing and partitioning of the data space to support efficient routing as the network scales up. Building an index ...
ISM
2006
IEEE
13 years 9 months ago
2006
IEEE
A novel indexing and access method, called Affinity Hybrid Tree (AH-Tree), is proposed to organize large image data sets efficiently and to support popular image access mechanisms...
IFIP
2009
Springer
14 years 3 months ago
2009
Springer
We firstly describe an algebraic structure which serves as solid basis to quantitatively reason about information flows. We demonstrate how programs in form of partition of state...
VMV
2007
13 years 10 months ago
2007
This article focuses on algorithms for fast computation of the Euclidean distance between a query point and a subdivision surface. The analyzed algorithms include uniform tessella...
SYRCODIS
2008
13 years 10 months ago
2008
Existing p2p file sharing networks doesn't always give their users abilities to make an effective and fast searches for particular data. In this paper we introduce some impro...