2950 search results - page 95 / 590 » Computing with Infinitely Many Processes |
140
click to vote
ECCV
2002
Springer
16 years 4 months ago
2002
Springer
Abstract. Natural scenes consist of a wide variety of stochastic patterns. While many patterns are represented well by statistical models in two dimensional regions as most image s...
222
click to vote
ICDE
2006
IEEE
16 years 3 months ago
2006
IEEE
A k-NN query finds the k nearest-neighbors of a given point from a point database. When it is sufficient to measure object distance using the Euclidian distance, the key to effici...
227
click to vote
ICDE
2005
IEEE
16 years 3 months ago
2005
IEEE
We present ViteX, an XPath processing system on XML streams with polynomial time complexity. ViteX uses a polynomial-space data structure to encode an exponential number of patter...
111
click to vote
MDM
2004
Springer
15 years 7 months ago
2004
Springer
We consider in this paper how to leverage heterogeneous mobile computing capability for efficient processing of real-time range-monitoring queries. In our environment, each mobil...
119
Voted
HIPC
1999
Springer
15 years 6 months ago
1999
Springer
Abstract. In this work we put into evidence how the memory performance of a WebServer machine may depend on the sharing induced by process migration. We considered a shared-bus sha...