Sciweavers

17 search results - page 3 / 4
» New hook length formulas for binary trees
Sort
View
IJCAI
1993
13 years 7 months ago
Multi-Interval Discretization of Continuous-Valued Attributes for Classification Learning
Since most real-world applications of classification learning involve continuous-valued attributes, properly addressing the discretization process is an important problem. This pa...
Usama M. Fayyad, Keki B. Irani
ICC
2009
IEEE
159views Communications» more  ICC 2009»
14 years 16 days ago
An Enhanced Multiple-Feedback Algorithm for RFID MAC Protocols
Abstract— This paper introduces two new tree-based anticollision schemes using multiple feedback symbols for uplink tag random access of emerging radio frequency identification (...
You-Chang Ko, Sumit Roy, Choong-Ho Cho, Hyong-Woo ...
VLSID
2005
IEEE
97views VLSI» more  VLSID 2005»
13 years 11 months ago
Q-PREZ: QBF Evaluation Using Partition, Resolution and Elimination with ZBDDs
In recent years, there has been an increasing interest in Quantified Boolean Formula (QBF) evaluation, since several VLSI CAD problems can be formulated efficiently as QBF insta...
Kameshwar Chandrasekar, Michael S. Hsiao
PR
2010
147views more  PR 2010»
13 years 4 months ago
Minimum classification error learning for sequential data in the wavelet domain
Wavelet analysis has found widespread use in signal processing and many classification tasks. Nevertheless, its use in dynamic pattern recognition have been much more restricted ...
D. Tomassi, Diego H. Milone, L. Forzani
NETWORKING
2008
13 years 7 months ago
The CPBT: A Method for Searching the Prefixes Using Coded Prefixes in B-Tree
Due to the increasing size of IP routing table and the growing rate of their lookups, many algorithms are introduced to achieve the required speed in table search and update or opt...
Mohammad Behdadfar, Hossein Saidi