Sciweavers

168 search results - page 16 / 34
» Dynamic Programming Algorithms for Transition-Based Dependen...
Sort
View
ASAP
2004
IEEE
185views Hardware» more  ASAP 2004»
15 years 1 months ago
Families of FPGA-Based Algorithms for Approximate String Matching
Dynamic programming for approximate string matching is a large family of different algorithms, which vary significantly in purpose, complexity, and hardware utilization. Many impl...
Tom Van Court, Martin C. Herbordt
INFOCOM
2010
IEEE
14 years 8 months ago
Leaping Multiple Headers in a Single Bound: Wire-Speed Parsing Using the Kangaroo System
—More fundamental than IP lookups and packet classification in routers is the extraction of fields such as IP Dest and TCP Ports that determine packet forwarding. While parsing...
Christos Kozanitis, John Huber, Sushil Singh, Geor...
HPDC
2005
IEEE
15 years 3 months ago
Genetic algorithm based automatic data partitioning scheme for HPF
good data partitioning scheme is the need of the time. However it is very diflcult to arrive at a good solution as the number of possible dutupartitionsfor a given real lifeprogra...
Sunil Kumar Anand, Y. N. Srikant
ECOOP
2004
Springer
15 years 3 months ago
Demand-Driven Type Inference with Subgoal Pruning: Trading Precision for Scalability
After two decades of effort, type inference for dynamically typed languages scales to programs of a few tens of thousands of lines of code, but no further. For larger programs, th...
S. Alexander Spoon, Olin Shivers
ICDCS
2003
IEEE
15 years 3 months ago
Compiler Scheduling of Mobile Agents for Minimizing Overheads
Mobile code carried by a mobile agent can automatically travel to several data sources in order to complete a designated program. Traditionally, most mobile agent systems [7][8][1...
Xiaotong Zhuang, Santosh Pande