Sciweavers

584 search results - page 56 / 117
» Efficient mass decomposition
Sort
View
ICDAR
2009
IEEE
14 years 4 months ago
A Novel Feature Extraction and Classification Methodology for the Recognition of Historical Documents
In this paper, we present a methodology for off-line character recognition that mainly focuses on handling the difficult cases of historical fonts and styles. The proposed methodo...
Georgios Vamvakas, Basilios Gatos, Stavros J. Pera...
ICMCS
2006
IEEE
127views Multimedia» more  ICMCS 2006»
14 years 4 months ago
Video and Audio Editing for Mobile Applications
Video content creation and consumption have been increasingly available for the masses with the emergence of handheld devices capable of shooting, downloading, and playing videos....
Ari Hourunranta, Asad Islam, Fehmi Chebil
VLDB
1997
ACM
169views Database» more  VLDB 1997»
14 years 2 months ago
Mining Insurance Data at Swiss Life
Huge masses of digital data about products, customers and competitors have become available for companies in the services sector. In order to exploit its inherent (and often hidde...
Jörg-Uwe Kietz, Ulrich Reimer, Martin Staudt
CIKM
2008
Springer
14 years 1 days ago
Managing collaborative feedback information for distributed retrieval
Despite the many research efforts invested recently in peerto-peer search engines, none of the proposed system has reached the level of quality and efficiency of their centralized...
Pascal Felber, Toan Luu, Martin Rajman, Etienne Ri...
CORR
2008
Springer
80views Education» more  CORR 2008»
13 years 10 months ago
Reserved-Length Prefix Coding
Huffman coding finds an optimal prefix code for a given probability mass function. Consider situations in which one wishes to find an optimal code with the restriction that all cod...
Michael B. Baer