Sciweavers

2969 search results - page 180 / 594
» A space efficient algorithm for group structure computation
Sort
View
EDBT
2010
ACM
185views Database» more  EDBT 2010»
15 years 5 months ago
Probabilistic threshold k nearest neighbor queries over moving objects in symbolic indoor space
The availability of indoor positioning renders it possible to deploy location-based services in indoor spaces. Many such services will benefit from the efficient support for k n...
Bin Yang 0002, Hua Lu, Christian S. Jensen
137
Voted
WWW
2007
ACM
16 years 4 months ago
Querying and maintaining a compact XML storage
As XML database sizes grow, the amount of space used for storing the data and auxiliary data structures becomes a major factor in query and update performance. This paper presents...
Raymond K. Wong, Franky Lam, William M. Shui
CVPR
1997
IEEE
16 years 5 months ago
Images as embedding maps and minimal surfaces: movies, color, and volumetric medical images
A general geometrical framework for image processing is presented. We consider intensity images as surfaces in the (x I) space. The image is thereby a two dimensional surface in t...
Ron Kimmel, Ravi Malladi, Nir A. Sochen
DAC
1996
ACM
15 years 7 months ago
Efficient Partial Enumeration for Timing Analysis of Asynchronous Systems
-- This paper presents an efficient method for the timing verification of concurrent systems, modeled as labeled Timed Petri nets. The verification problems we consider require us ...
Eric Verlind, Gjalt G. de Jong, Bill Lin
FOCS
2000
IEEE
15 years 8 months ago
Opportunistic Data Structures with Applications
There is an upsurging interest in designing succinct data structures for basic searching problems (see [23] and references therein). The motivation has to be found in the exponent...
Paolo Ferragina, Giovanni Manzini