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
21
search results - page 5 / 5
»
On-Line Linear-Time Construction of Word Suffix Trees
Sort
relevance
views
votes
recent
update
View
thumb
title
30
click to vote
SIAMCOMP
2002
142
views
more
SIAMCOMP 2002
»
On Binary Searching with Nonuniform Costs
13 years 8 months ago
Download
www.cs.ust.hk
Let us consider an ordered vector A[1 : n]. If the cost of testing each position is similar, then the standard binary search is the best strategy to search the vector. This is true...
Eduardo Sany Laber, Ruy Luiz Milidiú, Artur...
claim paper
Read More »
« Prev
« First
page 5 / 5
Last »
Next »