Sciweavers

1452 search results - page 76 / 291
» Algorithmic Analysis of Array-Accessing Programs
Sort
View
FAC
2008
100views more  FAC 2008»
13 years 11 months ago
Slicing communicating automata specifications: polynomial algorithms for model reduction
Abstract. Slicing is a program analysis technique that was originally introduced to improve program debugging and understanding. The purpose of a slicing algorithm is to remove the...
Sébastien Labbé, Jean-Pierre Gallois
EMNLP
2008
14 years 18 days ago
Scalable Language Processing Algorithms for the Masses: A Case Study in Computing Word Co-occurrence Matrices with MapReduce
This paper explores the challenge of scaling up language processing algorithms to increasingly large datasets. While cluster computing has been available in commercial environment...
Jimmy J. Lin
SAC
2010
ACM
14 years 4 months ago
An algorithm to generate the context-sensitive synchronized control flow graph
The verification of industrial systems specified with CSP often implies the analysis of many concurrent and synchronized components. The cost associated to these analyses is usu...
Marisa Llorens, Javier Oliver, Josep Silva, Salvad...
ICPR
2006
IEEE
15 years 8 days ago
An Efficient Radical-Based Algorithm for Stroke-Order-Free Online Kanji Character Recognition
This paper investigates improvements of an online handwriting stroke-order analysis algorithm -- cube search, based on cube graph stroke-order generation model and dynamic program...
Hiroaki Sakoe, Seiichi Uchida, Wenjie Cai
ISPD
2004
ACM
189views Hardware» more  ISPD 2004»
14 years 4 months ago
Almost optimum placement legalization by minimum cost flow and dynamic programming
VLSI placement tools usually work in two steps: First, the cells that have to be placed are roughly spread out over the chip area ignoring disjointness (global placement). Then, i...
Ulrich Brenner, Anna Pauli, Jens Vygen