1114 search results - page 206 / 223 » Optimizing XML Compression |
207
click to vote
COMBINATORICA
2010
15 years 25 days ago
2010
We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number k of pieces such that contracting any piece results in a graph of bou...
154
click to vote
FOCM
2011
15 years 25 days ago
2011
The matrix rank minimization problem has applications in many fields such as system identification, optimal control, low-dimensional embedding etc. As this problem is NP-hard in ...
187
click to vote
CSMR
2010
IEEE
15 years 24 days ago
2010
IEEE
Abstract--Concept or feature identification, i.e., the identification of the source code fragments implementing a particular feature, is a crucial task during software understandin...
270
click to vote
SIAMIS
2011
15 years 24 days ago
2011
The convergence rate is analyzed for the sparse reconstruction by separable approximation (SpaRSA) algorithm for minimizing a sum f(x) + ψ(x), where f is smooth and ψ is convex, ...
137
click to vote
TIT
2011
15 years 24 days ago
2011
— This paper presents new lower and upper bounds for the compression rate of binary prefix codes optimized over memoryless sources according to various nonlinear codeword length...