Sciweavers

5214 search results - page 93 / 1043
» The Online Specialization Problem
Sort
View
DRR
2009
13 years 6 months ago
Online computation of similarity between handwritten characters
We are interested in the problem of curve identification, motivated by problems in handwriting recognition. Various geometric approaches have been proposed, with one of the most p...
Oleg Golubitsky, Stephen M. Watt
IALP
2009
13 years 6 months ago
Challenges in Developing Persian Corpora from Online Resources
Persian is one of the Indo-European languages which has borrowed its script from Arabic, a member of Semitic language family. Since Persian and Arabic scripts are so similar, prob...
Masood Ghayoomi, Saeedeh Momtazi
SODA
2012
ACM
249views Algorithms» more  SODA 2012»
11 years 11 months ago
Improved competitive ratio for the matroid secretary problem
The Matroid Secretary Problem, introduced by Babaioff et al. (2007), is a generalization of the Classical Secretary Problem. In this problem, elements from a matroid are presente...
Sourav Chakraborty, Oded Lachish
FSTTCS
2005
Springer
14 years 2 months ago
The Directed Planar Reachability Problem
We investigate the s-t-connectivity problem for directed planar graphs, which is hard for L and is contained in NL but is not known to be complete. We show that this problem is log...
Eric Allender, Samir Datta, Sambuddha Roy
COCOON
2006
Springer
14 years 22 days ago
The Class Constrained Bin Packing Problem with Applications to Video-on-Demand
In this paper we present approximation results for the class constrained bin packing problem that has applications to Video-on-Demand Systems. In this problem we are given bins of...
E. C. Xavier, Flávio Keidi Miyazawa