Sciweavers

28 search results - page 1 / 6
» Competitive tree-structured dictionaries
Sort
View
COCOON
2005
Springer
13 years 10 months ago
Min-Energy Voltage Allocation for Tree-Structured Tasks
Westudyjobschedulingonprocessorscapableofrunningatvariablevoltage/speed tominimizeenergyconsumption.Eachjob ina probleminstanceisspecifiedbyitsarrivaltime and deadline, together w...
Minming Li, Becky Jie Liu, Frances F. Yao
SODA
2000
ACM
107views Algorithms» more  SODA 2000»
13 years 6 months ago
Competitive tree-structured dictionaries
In this note we describe a general technique for making treestructured dynamic dictionaries adapt to be competitive with the most efficient implementation, by using potential ener...
Michael T. Goodrich
INFOCOM
2010
IEEE
13 years 3 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
APIN
2000
87views more  APIN 2000»
13 years 4 months ago
The Architecture and Performance of a Stochastic Competitive Evolutionary Neural Tree Network
: A new dynamic tree structured network - the Stochastic Competitive Evolutionary Neural Tree (SCENT) is introduced. The network is able to provide a hierarchical classification of...
Neil Davey, Rod Adams, Stella J. George
ICDAR
2009
IEEE
13 years 2 months ago
ICDAR 2009 Handwriting Recognition Competition
This paper describes the handwriting recognition competition held at ICDAR 2009. This competition is based on the RIMES-database, with French written text documents. These documen...
Emmanuele Grosicki, Haikal El Abed