Sciweavers

1015 search results - page 99 / 203
» An efficient algorithm for AS path inferring
Sort
View
CN
2004
138views more  CN 2004»
13 years 8 months ago
Overhead energy considerations for efficient routing in wireless sensor networks
Energy is the most critical resource in the life of a wireless sensor node. Therefore, its usage must be optimized to maximize the network life. It is known that for higher path l...
E. Ilker Oyman, Cem Ersoy
ITIIS
2010
247views more  ITIIS 2010»
13 years 3 months ago
An Efficient Overlay for Unstructured P2P File Sharing over MANET using Underlying Cluster-based Routing
In traditional unstructured P2P file sharing network, each peer establishes connections with a certain number of randomly chosen other peers. This would lead to redundant traffic ...
Nadir Shah, Depei Qian
ICML
2008
IEEE
14 years 9 months ago
Beam sampling for the infinite hidden Markov model
The infinite hidden Markov model is a nonparametric extension of the widely used hidden Markov model. Our paper introduces a new inference algorithm for the infinite Hidden Markov...
Jurgen Van Gael, Yunus Saatci, Yee Whye Teh, Zoubi...
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
DASFAA
2007
IEEE
205views Database» more  DASFAA 2007»
14 years 5 days ago
Efficient Support for Ordered XPath Processing in Tree-Unaware Commercial Relational Databases
Abstract. In this paper, we present a novel ordered XPATH evaluation in treeunaware RDBMS. The novelties of our approach lies in the followings. (a) We propose a novel XML storage ...
Boon-Siew Seah, Klarinda G. Widjanarko, Sourav S. ...