Sciweavers

301 search results - page 30 / 61
» An efficient algorithm to verify generalized false paths
Sort
View
CIKM
2004
Springer
14 years 7 days ago
Efficient processing of XML twig patterns with parent child edges: a look-ahead approach
With the growing importance of semi-structure data in information exchange, much research has been done to provide an effective mechanism to match a twig query in an XML database....
Jiaheng Lu, Ting Chen, Tok Wang Ling
GIS
2005
ACM
14 years 9 months ago
Shapes based trajectory queries for moving objects
An interesting issue in moving objects databases is to find similar trajectories of moving objects. Previous work on this topic focuses on movement patterns (trajectories with tim...
Bin Lin, Jianwen Su
ICDT
2009
ACM
105views Database» more  ICDT 2009»
14 years 9 months ago
Efficient data structures for range-aggregate queries on trees
Graph-theoretic aggregation problems have been considered both in OLAP (grid graph) and XML (tree). This paper gives new results for MIN aggregation in a tree, where we want the M...
Hao Yuan, Mikhail J. Atallah
TON
2008
109views more  TON 2008»
13 years 8 months ago
Efficient routing in intermittently connected mobile networks: the single-copy case
Abstract--Intermittently connected mobile networks are wireless networks where most of the time there does not exist a complete path from the source to the destination. There are m...
Thrasyvoulos Spyropoulos, Konstantinos Psounis, Ca...
INFOCOM
2009
IEEE
14 years 3 months ago
ALDO: An Anomaly Detection Framework for Dynamic Spectrum Access Networks
—Dynamic spectrum access has been proposed as a means to share scarce radio resources, and requires devices to follow protocols that use resources in a proper, disciplined manner...
Song Liu, Yingying Chen, Wade Trappe, Larry J. Gre...