Sciweavers

161 search results - page 19 / 33
» Skewed Binary Search Trees
Sort
View
INFOCOM
2010
IEEE
13 years 7 months ago
High Performance Dictionary-Based String Matching for Deep Packet Inspection
—Dictionary-Based String Matching (DBSM) is used in network Deep Packet Inspection (DPI) applications virus scanning [1] and network intrusion detection [2]. We propose the Pipel...
Yi-Hua Edward Yang, Hoang Le, Viktor K. Prasanna
DATAMINE
1999
143views more  DATAMINE 1999»
13 years 8 months ago
Partitioning Nominal Attributes in Decision Trees
To find the optimal branching of a nominal attribute at a node in an L-ary decision tree, one is often forced to search over all possible L-ary partitions for the one that yields t...
Don Coppersmith, Se June Hong, Jonathan R. M. Hosk...
INFOCOM
2006
IEEE
14 years 2 months ago
Optimal Power Allocation in Wireless Networks with Transmitter-Receiver Power Tradeoffs
— For many wireless communication links, such as those employing turbo codes or sequentially-decoded convolutional codes, the power consumption of the decoder at the receiver dep...
Sudarshan Vasudevan, Chun Zhang, Dennis Goeckel, D...
SIGIR
2005
ACM
14 years 2 months ago
Boosted decision trees for word recognition in handwritten document retrieval
Recognition and retrieval of historical handwritten material is an unsolved problem. We propose a novel approach to recognizing and retrieving handwritten manuscripts, based upon ...
Nicholas R. Howe, Toni M. Rath, R. Manmatha
SODA
2012
ACM
174views Algorithms» more  SODA 2012»
11 years 11 months ago
Using hashing to solve the dictionary problem
We consider the dictionary problem in external memory and improve the update time of the wellknown buffer tree by roughly a logarithmic factor. For any λ ≥ max{lg lg n, logM/B(...
John Iacono, Mihai Patrascu