Sciweavers

306 search results - page 35 / 62
» Parameterized matching with mismatches
Sort
View
ICDAR
1999
IEEE
14 years 8 days ago
Partitioning and Searching Dictionary for Correction of Optically Read Devanagari Character Strings
Abstract. This paper describes a method for correction of optically read Devanagari character strings using a Hindi word dictionary. The word dictionary is partitioned in order to ...
Veena Bansal, R. M. K. Sinha
MKWI
2008
190views Business» more  MKWI 2008»
13 years 9 months ago
Partial Matchmaking for complex Product and Service Descriptions
: Matchmaking between offers and requests is an essential mechanism in electronic market places. Description Logics have been proposed as a appropriate framework for representing o...
Heiner Stuckenschmidt, Martin Kolb
WWW
2011
ACM
13 years 2 months ago
Web scale NLP: a case study on url word breaking
This paper uses the URL word breaking task as an example to elaborate what we identify as crucialin designingstatistical natural language processing (NLP) algorithmsfor Web scale ...
Kuansan Wang, Christopher Thrasher, Bo-June Paul H...
CHI
2003
ACM
14 years 8 months ago
Designing social presence of social actors in human computer interaction
This study examines the interaction effect between user factors and media factors on feelings of social presence which are critical in the design of virtual reality systems and hu...
Kwan Min Lee, Clifford Nass
ISDA
2009
IEEE
14 years 2 months ago
Similarity Analysis of Protein Binding Sites: A Generalization of the Maximum Common Subgraph Measure Based on Quasi-Clique Dete
—Protein binding sites are often represented by means of graphs capturing their most important geometrical and physicochemical properties. Searching for structural similarities a...
Imen Boukhris, Zied Elouedi, Thomas Fober, Marco M...