Sciweavers

20441 search results - page 3759 / 4089
» Locally Computable Structures
Sort
View
IM
2006
15 years 4 months ago
Estimating Entropy and Entropy Norm on Data Streams
We consider the problem of computing information theoretic functions such as entropy on a data stream, using sublinear space. Our first result deals with a measure we call the &quo...
Amit Chakrabarti, Khanh Do Ba, S. Muthukrishnan
INFSOF
2006
73views more  INFSOF 2006»
15 years 4 months ago
Theory and algorithms for slicing unstructured programs
Program slicing identifies parts of a program that potentially affect a chosen computation. It has many applications in software engineering, including maintenance, evolution and ...
Mark Harman, Arun Lakhotia, David Binkley
JDA
2008
72views more  JDA 2008»
15 years 4 months ago
Semi-local longest common subsequences in subquadratic time
For two strings a, b of lengths m, n respectively, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In this paper, ...
Alexander Tiskin
JDA
2008
84views more  JDA 2008»
15 years 4 months ago
Red-blue covering problems and the consecutive ones property
Set Cover problems are of core importance in many applications. In recent research, the "red-blue variants" where blue elements all need to be covered whereas red elemen...
Michael Dom, Jiong Guo, Rolf Niedermeier, Sebastia...
CSDA
2007
123views more  CSDA 2007»
15 years 4 months ago
Bayesian estimation of unrestricted and order-restricted association models for a two-way contingency table
In two-way contingency tables analysis, a popular class of models for describing the structure of the association between the two categorical variables are the so-called “associ...
G. Iliopoulos, Maria Kateri, Ioannis Ntzoufras
« Prev « First page 3759 / 4089 Last » Next »