Sciweavers

4722 search results - page 207 / 945
» Representation-independent program analysis
Sort
View
ICDAR
2009
IEEE
14 years 4 months ago
Multi-Oriented and Multi-Sized Touching Character Segmentation Using Dynamic Programming
In this paper, we present a scheme towards the segmentation of English multi-oriented touching strings into individual characters. When two or more characters touch, they generate...
Partha Pratim Roy, Umapada Pal, Josep Lladó...
IEEEPACT
2009
IEEE
14 years 4 months ago
Interprocedural Load Elimination for Dynamic Optimization of Parallel Programs
Abstract—Load elimination is a classical compiler transformation that is increasing in importance for multi-core and many-core architectures. The effect of the transformation is ...
Rajkishore Barik, Vivek Sarkar
AAAI
2000
13 years 11 months ago
The Game of Hex: An Automatic Theorem Proving Approach to Game Programming
The game of Hex is a two-player game with simple rules, a deep underlying mathematical beauty, and a strategic complexity comparable to that of Chess and Go. The massive game-tree...
Vadim V. Anshelevich
SAC
2006
ACM
13 years 9 months ago
powerJava: ontologically founded roles in object oriented programming languages
In this paper we introduce a new view on roles in Object Oriented programming languages, based on an ontological analysis of roles. A role is always associated with an object inst...
Matteo Baldoni, Guido Boella, Leendert W. N. van d...
STOC
2004
ACM
102views Algorithms» more  STOC 2004»
14 years 10 months ago
A simple polynomial-time rescaling algorithm for solving linear programs
The perceptron algorithm, developed mainly in the machine learning literature, is a simple greedy method for finding a feasible solution to a linear program (alternatively, for le...
John Dunagan, Santosh Vempala