Sciweavers

91 search results - page 16 / 19
» Finding an Optimal Path without Growing the Tree
Sort
View
ICC
2007
IEEE
171views Communications» more  ICC 2007»
14 years 2 months ago
Progressive Route Calculation Protocol for Wireless Mesh Networks
—Although network-wide flooding in reactive routing protocols like AODV [1] facilitates the discovery of optimal routes, they engender large control overhead. Some efficient floo...
Xuhui Hu, Myung J. Lee, Tarek N. Saadawi
MOBIHOC
2006
ACM
14 years 7 months ago
Fundamental scaling laws for energy-efficient storage and querying in wireless sensor networks
We use a constrained optimization framework to derive fundamental scaling laws for both unstructured sensor networks (which use blind sequential search for querying) and structure...
Joon Ahn, Bhaskar Krishnamachari
SIGMOD
2009
ACM
182views Database» more  SIGMOD 2009»
14 years 8 months ago
3-HOP: a high-compression indexing scheme for reachability query
Reachability queries on large directed graphs have attracted much attention recently. The existing work either uses spanning structures, such as chains or trees, to compress the c...
Ruoming Jin, Yang Xiang, Ning Ruan, David Fuhry
JACM
2008
91views more  JACM 2008»
13 years 7 months ago
On the minimization of XPath queries
XML queries are usually expressed by means of XPath expressions identifying portions of the selected documents. An XPath expression defines a way of navigating an XML tree and ret...
Sergio Flesca, Filippo Furfaro, Elio Masciari
CIKM
2004
Springer
13 years 11 months 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