Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
3641
search results - page 729 / 729
»
On Computability of Pattern Recognition Problems
Sort
relevance
views
votes
recent
update
View
thumb
title
46
click to vote
IANDC
2008
141
views
more
IANDC 2008
»
Graph connectivity, partial words, and a theorem of Fine and Wilf
13 years 9 months ago
Download
www.uncg.edu
The problem of computing periods in words, or finite sequences of symbols from a finite alphabet, has important applications in several areas including data compression, string se...
Francine Blanchet-Sadri, Deepak Bal, Gautam Sisodi...
claim paper
Read More »
« Prev
« First
page 729 / 729
Last »
Next »