Sciweavers

672 search results - page 73 / 135
» Words and forbidden factors
Sort
View
JSAC
2010
132views more  JSAC 2010»
13 years 3 months ago
Very Efficient Balanced Codes
The prior art construction of sets of balanced codewords by Knuth is attractive for its simplicity and absence of look-up tables, but the redundancy of the balanced codes generated...
K. Schouhamer Immink, J. Weber
SIAMMAX
2010
134views more  SIAMMAX 2010»
13 years 3 months ago
Dynamical Tensor Approximation
For the approximation of time-dependent data tensors and of solutions to tensor differential equations by tensors of low Tucker rank, we study a computational approach that can be ...
Othmar Koch, Christian Lubich
SIAMCOMP
2011
12 years 11 months ago
Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut
We consider the Minimum Linear Arrangement problem and the (Uniform) Sparsest Cut problem. So far, these two notorious NP-hard graph problems have resisted all attempts to prove in...
Christoph Ambühl, Monaldo Mastrolilli, Ola Sv...
LICS
2012
IEEE
11 years 11 months ago
Graph Logics with Rational Relations and the Generalized Intersection Problem
Abstract—We investigate some basic questions about the interaction of regular and rational relations on words. The primary motivation comes from the study of logics for querying ...
Pablo Barceló, Diego Figueira, Leonid Libki...
ACMDIS
2008
ACM
13 years 10 months ago
Evaluating the effectiveness of term frequency histograms for supporting interactive web search tasks
Throughout many of the different types of Web searches people perform, the primary tasks are to first craft a query that effectively captures their information needs, and then eva...
Orland Hoeber, Xue Dong Yang