Sciweavers

299 search results - page 21 / 60
» On Graph Query Optimization in Large Networks
Sort
View
SEMWEB
2004
Springer
15 years 7 months ago
Top-k Query Evaluation for Schema-Based Peer-to-Peer Networks
Abstract. Increasing the number of peers in a peer-to-peer network usually increases the number of answers to a given query as well. While having more answers is nice in principle,...
Wolfgang Nejdl, Wolf Siberski, Uwe Thaden, Wolf-Ti...
CIKM
2005
Springer
15 years 3 months ago
DIST: a distributed spatio-temporal index structure for sensor networks
We consider the general problem of tracking moving objects in sensor networks. The specific application we consider is that of tracking a chemical plume moving over a large infra...
Anand Meka, Ambuj K. Singh
BMCBI
2008
208views more  BMCBI 2008»
15 years 2 months ago
GraphFind: enhancing graph searching by low support data mining techniques
Background: Biomedical and chemical databases are large and rapidly growing in size. Graphs naturally model such kinds of data. To fully exploit the wealth of information in these...
Alfredo Ferro, Rosalba Giugno, Misael Mongiov&igra...
CORR
2008
Springer
141views Education» more  CORR 2008»
15 years 2 months ago
Truthful Unsplittable Flow for Large Capacity Networks
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...
Yossi Azar, Iftah Gamzu, Shai Gutner
UBIMOB
2009
ACM
225views Management» more  UBIMOB 2009»
15 years 6 months ago
Historical data storage for large scale sensor networks
Wireless sensor networks are rapidly finding their way through a plethora of new applications like precision farming and forestry, with increasing network scale, system complexit...
Loïc Petit, Abdelhamid Nafaa, Raja Jurdak