Sciweavers

660 search results - page 50 / 132
» words 2003
Sort
View
SODA
2003
ACM
103views Algorithms» more  SODA 2003»
14 years 11 months ago
On the rectilinear crossing number of complete graphs
We prove a lower bound of 0.3288   n 4¡ for the rectilinear crossing number cr(Kn) of a complete graph on n vertices, or in other words, for the minimum number of convex quadril...
Uli Wagner
INFORMATICALT
2007
81views more  INFORMATICALT 2007»
14 years 9 months ago
Security Flaw in Simple Generalized Group-Oriented Cryptosystem Using ElGamal Cryptosystem
A generalized group-oriented cryptosystem (GGOC) based on ElGamal cryptosystem was proposed by Yang et al. in 2003. This study shows that if the authorized decryption sets of users...
Chuan-Ming Li, Tzonelih Hwang, Narn-Yih Lee
WWW
2003
ACM
15 years 10 months ago
An Effective Complete-Web Recommender System
There are a number of recommendation systems that can suggest the webpages, within a single website, that other (purportedly similar) users have visited. By contrast, our goal is ...
Gerald Häubl, Russell Greiner, Tingshao Zhu
ICDAR
2003
IEEE
15 years 3 months ago
Localization, Extraction and Recognition of Text in Telugu Document Images
In this paper we present a system to locate, extract and recognize Telugu text. The circular nature of Telugu script is exploited for segmenting text regions using the Hough Trans...
Atul Negi, K. Nikhil Shanker, Chandra Kanth Chered...
CICLING
2003
Springer
15 years 2 months ago
Automatic Sense Disambiguation of the Near-Synonyms in a Dictionary Entry
We present an automatic method to disambiguate the senses of the near-synonyms in the entries of a dictionary of synonyms. We combine different indicators that take advantage of th...
Diana Zaiu Inkpen, Graeme Hirst