Sciweavers

1983 search results - page 261 / 397
» Competitive graph searches
Sort
View
JSA
2008
124views more  JSA 2008»
13 years 8 months ago
Processor array architectures for flexible approximate string matching
In this paper, we present linear processor array architectures for flexible approximate string matching. These architectures are based on parallel realization of dynamic programmi...
Panagiotis D. Michailidis, Konstantinos G. Margari...
PAMI
1998
92views more  PAMI 1998»
13 years 8 months ago
INFORMys: A Flexible Invoice-Like Form-Reader System
—In this paper, we describe a flexible form-reader system capable of extracting textual information from accounting documents, like invoices and bills of service companies. In th...
Francesca Cesarini, Marco Gori, Simone Marinai, Gi...
TKDE
2002
133views more  TKDE 2002»
13 years 8 months ago
ImageMap: An Image Indexing Method Based on Spatial Similarity
We introduce ImageMap, as a method for indexing and similarity searching in Image DataBases (IDBs). ImageMap answers "queries by example", involving any number of object...
Euripides G. M. Petrakis, Christos Faloutsos, King...
PPDP
2010
Springer
13 years 6 months ago
Dimensions in program synthesis
Program Synthesis, which is the task of discovering programs that realize user intent, can be useful in several scenarios: enabling people with no programming background to develo...
Sumit Gulwani
CORR
2011
Springer
208views Education» more  CORR 2011»
13 years 3 months ago
GRASP and path-relinking for Coalition Structure Generation
In Artificial Intelligence with Coalition Structure Generation (CSG) one refers to those cooperative complex problems that require to find an optimal partition, maximising a soci...
Nicola Di Mauro, Teresa Maria Altomare Basile, Ste...