Keyword List
Japanese Page
SITE TOP
Login
To browse Full-Text PDF.
>
Forgotten your password?
Menu
Search
Full-Text Search
Search(JPN)
Latest Issue
A Fundamentals
Trans.Fundamentals.
JPN Edition(in Japanese)
B Communications
Trans.Commun.
JPN Edition(in Japanese)
C Electronics
Trans.Electron.
JPN Edition(in Japanese)
D Information & Systems
Trans.Inf.&Syst.
JPN Edition(in Japanese)
Abstracts of JPN Edition
Trans.Fundamentals.
Trans.Commun.
Trans.Electron.
Trans.Inf.&Syst.
Archive
Volume List
Trans.Fundamentals.
Trans.Commun.
Trans.Electron.
Trans.Inf.&Syst.
Transactions (1976-1990)
Volume List [JPN Edition]
A JPN Edition(in Japanese)
B JPN Edition(in Japanese)
C JPN Edition(in Japanese)
D JPN Edition(in Japanese)
Editorial Board & Reviewers
Open Access Papers
Trans. Commun.
Trans. Commun.(JPN Edition)
Link
Subscription
Join IEICE
Library/Nonmember
Pay Per View
A Fundamentals
B Communications
C Electronics
D Information & Systems
For Authors
Article Search(I-Scover)
IEICE Home Page
Citation Index
Privacy Policy
Copyright & Permissions
Copyright (c) by IEICE
Keyword : offline algorithm
Optimal Online and Offline Algorithms for Finding Longest and Shortest Subsequences with Length and Sum Constraints
Sung Kwon KIM
Publication:
IEICE TRANSACTIONS on Information and Systems
Publication Date:
2010/02/01
Vol.
E93-D
No.
2
pp.
250-256
Type of Manuscript:
Special Section PAPER (Special Section on Foundations of Computer Science)
Category:
Keyword:
length constraint
,
longest subsequence
,
offline algorithm
,
online algorithm
,
shortest subsequence
,
sum constraint
,
Summary
|
Full Text:PDF
(551.8KB)