Sciweavers

785 search results - page 61 / 157
» Binary Join Trees
Sort
View
PAKDD
2004
ACM
186views Data Mining» more  PAKDD 2004»
15 years 3 months ago
CMTreeMiner: Mining Both Closed and Maximal Frequent Subtrees
Abstract. Tree structures are used extensively in domains such as computational biology, pattern recognition, XML databases, computer networks, and so on. One important problem in ...
Yun Chi, Yirong Yang, Yi Xia, Richard R. Muntz
TSP
2008
76views more  TSP 2008»
14 years 9 months ago
On the Impact of Node Failures and Unreliable Communications in Dense Sensor Networks
We consider the problem of decentralized detection in failure-prone tree networks with bounded height. Specifically, we study and contrast the impact on the detection performance o...
Wee-Peng Tay, John N. Tsitsiklis, Moe Z. Win
ICDE
2005
IEEE
131views Database» more  ICDE 2005»
15 years 11 months ago
On the Sequencing of Tree Structures for XML Indexing
Sequence-based XML indexing aims at avoiding expensive join operations in query processing. It transforms structured XML data into sequences so that a structured query can be answ...
Haixun Wang, Xiaofeng Meng
ICCD
2008
IEEE
120views Hardware» more  ICCD 2008»
15 years 6 months ago
Improved combined binary/decimal fixed-point multipliers
Abstract— Decimal multiplication is important in many commercial applications including banking, tax calculation, currency conversion, and other financial areas. This paper pres...
Brian J. Hickmann, Michael J. Schulte, Mark A. Erl...
ICDCSW
2003
IEEE
15 years 3 months ago
Computation of Minimal Uniform Transmission Power in Ad Hoc Wireless Networks
Power conservation is a critical issue for ad hoc wireless networks. The main objective of the paper is to find the minimum uniform transmission power of an ad hoc wireless netwo...
Qing Dai, Jie Wu