Sciweavers

168 search results - page 26 / 34
» An Upper Bound for B2[2] Sequences
Sort
View
SODA
2008
ACM
111views Algorithms» more  SODA 2008»
13 years 9 months ago
On distance to monotonicity and longest increasing subsequence of a data stream
In this paper we consider problems related to the sortedness of a data stream. First we investigate the problem of estimating the distance to monotonicity; given a sequence of len...
Funda Ergün, Hossein Jowhari
ACL
1996
13 years 9 months ago
Another Facet of LIG Parsing
In this paper 1 we present a new parsing algorithm for linear indexed grammars (LIGs) in the same spirit as the one described in (Vijay-Shanker and Weir, 1993) for tree adjoining ...
Pierre Boullier
CORR
2010
Springer
99views Education» more  CORR 2010»
13 years 8 months ago
An Automated Algorithm for Approximation of Temporal Video Data Using Linear B'EZIER Fitting
This paper presents an efficient method for approximation of temporal video data using linear Bezier fitting. For a given sequence of frames, the proposed method estimates the int...
Murtaza Ali Khan
IPL
2002
74views more  IPL 2002»
13 years 7 months ago
Restricted rotation distance between binary trees
Restricted rotation distance between pairs of rooted binary trees measures differences in tree shape and is related to rotation distance. In restricted rotation distance, the rota...
Sean Cleary
CORR
2010
Springer
153views Education» more  CORR 2010»
13 years 8 months ago
To Feed or Not to Feed Back
We study the communication over Finite State Channels (FSCs), where the encoder and the decoder can control the availability or the quality of the noise-free feedback. Specificall...
Himanshu Asnani, Haim H. Permuter, Tsachy Weissman