A k-hop dominating set is a subset of nodes such that each node not in the set can be reached within k hops from at least one node in the set. A connected k-hop dominating set can ...
—To establish the interference canceller, generating replicas of unwanted carriers is a key. This paper addresses the design and performances of two types of signal canceller tha...
Mayumi Osato, Hiroyuki Kobashi, Robert Y. Omaki, T...
Abstract Research in the field of sign language recognition has made significant advances in recent years. The present achievements provide the basis for future applications with t...
Distributed optimal traffic engineering in the presence of multiple paths has been found to be a difficult problem to solve. In this paper, we introduce a new approach in an attem...
Existing e-commerce applications on the web provide the users a relatively simple, browser-based interface to access available products. Customers are not provided with the same s...
Xiaojun Shen, T. Radakrishnan, Nicolas D. Georgana...