Sciweavers

4218 search results - page 342 / 844
» Complete sets of cooperations
Sort
View
227
Voted
CIMCA
2006
IEEE
16 years 1 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
WINE
2005
Springer
107views Economy» more  WINE 2005»
16 years 1 months ago
Price of Anarchy of Network Routing Games with Incomplete Information
We consider a class of networks where n agents need to send their traffic from a given source to a given destination over m identical, non-intersecting, and parallel links. For suc...
Dinesh Garg, Yadati Narahari
FORMATS
2008
Springer
15 years 9 months ago
Complexity of Metric Temporal Logics with Counting and the Pnueli Modalities
The common metric temporal logics for continuous time were shown to be insufficient, when it was proved in [7, 12] that they cannot express a modality suggested by Pnueli. Moreover...
Alexander Rabinovich
AND
2009
15 years 5 months ago
Digital weight watching: reconstruction of scanned documents
A web-portal providing access to over 250.000 scanned and OCRed cultural heritage documents is analyzed. The collection consists of the complete Dutch Hansard from 1917 to 1995. E...
Tim Gielissen, Maarten Marx
CP
2003
Springer
16 years 22 days ago
Open Constraint Optimization
Constraint satisfaction has been applied with great success in closed-world scenarios, where all options and constraints are known from the beginning and fixed. With the internet,...
Boi Faltings, Santiago Macho-Gonzalez