7129 search results - page 1183 / 1426 » Approximation Algorithms for Treewidth |
134
click to vote
TIT
2008
15 years 3 months ago
2008
Variable-to-variable codes are very attractive yet not well understood data compression schemes. In 1972 Khodak claimed to provide upper and lower bounds for the achievable redund...
134
click to vote
CAD
2005
Springer
15 years 3 months ago
2005
Springer
Subdivision surfaces are generated by repeated approximation or interpolation from initial control meshes. In this paper, two new nonlinear subdivision schemes, face based subdivi...
127
click to vote
PVLDB
2008
15 years 2 months ago
2008
Summaries of massive data sets support approximate query processing over the original data. A basic aggregate over a set of records is the weight of subpopulations specified as a ...
150
click to vote
CIKM
2010
Springer
15 years 1 months ago
2010
Springer
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
141
click to vote
TCS
2010
15 years 1 months ago
2010
The Correlation Clustering problem, also known as the Cluster Editing problem, seeks to edit a given graph by adding and deleting edges to obtain a collection of disconnected cliq...