1508 search results - page 283 / 302 » Efficient Path Profiling |
INFOCOM
2006
IEEE
14 years 1 months ago
2006
IEEE
—Routing algorithms such as Distance Vector and Link States have the routing table size as ΩΩΩΩ (n), where n is the number of destination identifiers, thus providing only...
SENSYS
2006
ACM
14 years 1 months ago
2006
ACM
Varying interference levels make broadcasting an unreliable operation in low-power wireless networks. Many routing and resource discovery protocols depend on flooding (repeated pe...
ITCC
2005
IEEE
14 years 1 months ago
2005
IEEE
has to be relayed to nodes interested in those events. Moreover, nodes may also generate queries to find events they are interested in. Thus there is a need to route the informatio...
CIKM
2005
Springer
14 years 1 months ago
2005
Springer
XML documents are frequently used in applications such as business transactions and medical records involving sensitive information. Typically, parts of documents should be visibl...
CIKM
2007
Springer
13 years 11 months ago
2007
Springer
We investigate the problem of how to evaluate, fast and efficiently, classes of optimal route queries on a massive graph in a unified framework. To evaluate a route query effectiv...