Sciweavers

1760 search results - page 63 / 352
» Connected Set Cover Problem and Its Applications
Sort
View
CIMCA
2006
IEEE
14 years 3 months ago
A Junction Based Segmentation Algorithm for Offline Handwritten Connected Character Segmentation
A junction based approach for Segmenting and recognizing offline handwritten connected twodigit strings is presented in this paper. Very often even in a printed text, adjacent cha...
U. K. S. Jayarathna, G. E. M. D. C. Bandara
CORR
2004
Springer
103views Education» more  CORR 2004»
13 years 8 months ago
The Freeze-Tag Problem: How to Wake Up a Swarm of Robots
An optimization problem that naturally arises in the study of swarm robotics is the Freeze-Tag Problem (FTP) of how to awaken a set of "asleep" robots, by having an awak...
Esther M. Arkin, Michael A. Bender, Sándor ...
FSTTCS
2004
Springer
14 years 2 months ago
Improved Approximation Algorithms for Maximum Graph Partitioning Problems
Abstract Abstract. In this paper we improve the analysis of approximation algorithms based on semidefinite programming for the maximum graph partitioning problems MAX-k-CUT, MAX-k...
Gerold Jäger, Anand Srivastav
IMAGING
2003
13 years 10 months ago
Spectral Color Processing Using an Interim Connection Space
The use of an Interim Connection Space (ICS) is proposed as a means for extending the concept of device independent color management to support spectral imaging. Color management,...
Mitchell R. Rosen, Noboru Ohta
JPDC
2007
138views more  JPDC 2007»
13 years 9 months ago
Distributed computation of the knn graph for large high-dimensional point sets
High-dimensional problems arising from robot motion planning, biology, data mining, and geographic information systems often require the computation of k nearest neighbor (knn) gr...
Erion Plaku, Lydia E. Kavraki