Sciweavers

2489 search results - page 28 / 498
» On the Subgroup Distance Problem
Sort
View
GIS
2006
ACM
14 years 8 months ago
Computing longest duration flocks in trajectory data
Moving point object data can be analyzed through the discovery of patterns. We consider the computational efficiency of computing two of the most basic spatio-temporal patterns in...
Joachim Gudmundsson, Marc J. van Kreveld
FOCS
2002
IEEE
14 years 11 days ago
Graph Isomorphism is in SPP
We show that Graph Isomorphism is in the complexity class SPP, and hence it is in ⊕P (in fact, it is in ModkP for each k ≥ 2). We derive this result as a corollary of a more g...
Vikraman Arvind, Piyush P. Kurur
IPL
2008
114views more  IPL 2008»
13 years 7 months ago
Faster algorithms for guided tree edit distance
The guided tree edit distance problem is to find a minimum cost series of edit operations that transforms two input forests F and G into isomorphic forests F and G such that a thi...
Dekel Tsur
ICASSP
2010
IEEE
13 years 7 months ago
On distance reconstruction for sensor network localization
Sensor localization typically exploits distance measurements to infer sensor positions with respect to known anchor nodes. Missing or unreliable measurements for specific nodes c...
Phillip A. Regalia, Jing Wang
TMC
2010
152views more  TMC 2010»
13 years 5 months ago
On Multihop Distances in Wireless Sensor Networks with Random Node Locations
—Location and intersensor distance estimations are important functions for the operation of wireless sensor networks, especially when protocols can benefit from the distance info...
Serdar Vural, Eylem Ekici