4843 search results - page 445 / 969 » The Shortcut Problem - Complexity and Approximation |
153
Voted
ESA
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...
161
click to vote
TCS
2010
15 years 3 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...
162
click to vote
ECCV
2002
Springer
16 years 7 months ago
2002
Springer
Abstract. In many vision problems, the observed data lies in a nonlinear manifold in a high-dimensional space. This paper presents a generic modelling scheme to characterize the no...
221
click to vote
ICDE
2006
IEEE
16 years 6 months ago
2006
IEEE
K-Anonymity has been proposed as a mechanism for protecting privacy in microdata publishing, and numerous recoding "models" have been considered for achieving kanonymity...
256
click to vote
ICDE
2001
IEEE
16 years 6 months ago
2001
IEEE
We study the problem of approximately answering aggregation queries using sampling. We observe that uniform sampling performs poorly when the distribution of the aggregated attrib...