31 search results - page 4 / 7 » Efficient Algorithms for Computing the Nearest Polynomial wi... |
ICDE
2010
IEEE
14 years 5 months ago
2010
IEEE
K Nearest Neighbor search has many applications including data mining, multi-media, image processing, and monitoring moving objects. In this paper, we study the problem of KNN over...
ICALP
2011
Springer
12 years 8 months ago
2011
Springer
We consider the following Tree-Constrained Bipartite Matching problem: Given two rooted trees T1 = (V1, E1), T2 = (V2, E2) and a weight function w : V1 × V2 → R+, find a maximu...
COCO
2008
Springer
13 years 7 months ago
2008
Springer
We study the complexity of deciding whether a given homogeneous multivariate polynomial has a nontrivial root over a finite field. Given a homogeneous algebraic circuit C that com...
GIS
2006
ACM
14 years 6 months ago
2006
ACM
Given a query point and a collection of spatial features, a multi-type nearest neighbor (MTNN) query finds the shortest tour for the query point such that only one instance of eac...
SECON
2010
IEEE
13 years 3 months ago
2010
IEEE
In a wireless sensor network, short range multihop transmissions are preferred to prolong the network lifetime due to super-linear nature of energy consumption with communication d...