Sciweavers

10997 search results - page 41 / 2200
» On the Structure of Complete Sets
Sort
View
ICDAR
2009
IEEE
14 years 4 months ago
Isolated Handwritten Farsi Numerals Recognition Using Sparse and Over-Complete Representations
A new isolated handwritten Farsi numeral recognition algorithm is proposed in this paper, which exploits the sparse and over-complete structure from the handwritten Farsi numeral ...
Wumo Pan, Tien D. Bui, Ching Y. Suen
APPROX
2009
Springer
153views Algorithms» more  APPROX 2009»
14 years 4 months ago
Average-Case Analyses of Vickrey Costs
We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the V...
Prasad Chebolu, Alan M. Frieze, Páll Melste...
DIS
1998
Springer
14 years 2 months ago
Development of SDS2: Smart Discovery System for Simultaneous Equation Systems
SDS2 is a system to discover and identify the quantitative model consisting of simultaneous equations re ecting the rst principles underlying the objective process through experi...
Takashi Washio, Hiroshi Motoda
GECCO
2003
Springer
116views Optimization» more  GECCO 2003»
14 years 3 months ago
A Hybrid Genetic Algorithm Based on Complete Graph Representation for the Sequential Ordering Problem
Abstract. A hybrid genetic algorithm is proposed for the sequential ordering problem. It is known that the performance of a genetic algorithm depends on the survival environment an...
Dong-il Seo, Byung Ro Moon
DIAGRAMS
2000
Springer
14 years 2 months ago
On the Completeness and Expressiveness of Spider Diagram Systems
Spider diagram systems provide a visual language that extends the popular and intuitive Venn diagrams and Euler circles. Designed to complement object-oriented modelling notations ...
John Howse, Fernando Molina, John Taylor