Sciweavers

970 search results - page 105 / 194
» Adaptive Analysis of On-line Algorithms
Sort
View
MFCS
2009
Springer
15 years 5 months ago
An Improved Approximation Bound for Spanning Star Forest and Color Saving
We present a simple algorithm for the maximum spanning star forest problem. We take advantage of the fact that the problem is a special case of complementary set cover and we adapt...
Stavros Athanassopoulos, Ioannis Caragiannis, Chri...
ICDAR
2005
IEEE
15 years 6 months ago
Prototype Learning Methods for Online Handwriting Recognition
In this paper, we study different methods for prototype selection for recognizing handwritten characters of Tamil script. In the first method, cumulative pairwise- distances of th...
B. S. Raghavendra, C. K. Narayanan, G. Sita, A. G....
DAS
2010
Springer
15 years 25 days ago
Context-aware and content-based dynamic Voronoi page segmentation
This paper presents a dynamic approach to document page segmentation based on inter-component relationships and their local features. State-of-the art page segmentation algorithms...
Mudit Agrawal, David S. Doermann
113
Voted
DOA
2001
137views more  DOA 2001»
15 years 2 months ago
Supporting Distributed Processing of Time-Based Media Streams
There are many challenges in devising solutions for online content processing of live networked multimedia sessions. These include content analysis under uncertainty (evidence of ...
Viktor S. Wold Eide, Frank Eliassen, Olav Lysne
106
Voted
SIGSOFT
2008
ACM
16 years 1 months ago
Profile-guided program simplification for effective testing and analysis
Many testing and analysis techniques have been developed for inhouse use. Although they are effective at discovering defects before a program is deployed, these techniques are oft...
Lingxiao Jiang, Zhendong Su