15073 search results - page 2702 / 3015 » Probabilistic algorithms for computing resultants |
140
click to vote
EDBT
2002
ACM
16 years 4 months ago
2002
ACM
Abstract. This work addresses the problem of querying moving objects databases. which capture the inherent uncertainty associated with the location of moving point objects. We addr...
145
click to vote
ICIAP
2005
ACM
16 years 4 months ago
2005
ACM
This paper presents an efficient implementation of moving least square(MLS) approximation for 3D surface reconstruction. The smoothness of the MLS is mainly determined by the weigh...
131
Voted
ICDE
2010
IEEE
16 years 3 months ago
2010
IEEE
A fundamental problem in XML query processing is tree pattern query (TPQ) matching which computes all data instances in an XML database that match an input TPQ. There is a lot of r...
148
click to vote
PERCOM
2008
ACM
16 years 3 months ago
2008
ACM
As the scale of modern sensor networks continues to grow, energy consumption, scalability and routing efficiency are becoming key design challenges. Network management plays an im...
135
click to vote
PERCOM
2007
ACM
16 years 3 months ago
2007
ACM
In this paper, we study the static path planning problem with wireless sensor network localization as the primary objective. We consider a model in which sensors are assumed to be...