2137 search results - page 301 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
145
click to vote
COLT
2010
Springer
15 years 3 months ago
2010
Springer
We consider the dimensionality-reduction problem (finding a subspace approximation of observed data) for contaminated data in the high dimensional regime, where the number of obse...
161
click to vote
TCBB
2011
14 years 12 months ago
2011
—We study the problem of merging genetic maps, when the individual genetic maps are given as directed acyclic graphs. The computational problem is to build a consensus map, which...
158
click to vote
FSTTCS
2001
Springer
15 years 9 months ago
2001
Springer
Abstract. We propose a novel approach to clustering, based on deterministic analysis of random walks on the weighted graph associated with the clustering problem. The method is cen...
187
click to vote
WADS
2001
Springer
15 years 9 months ago
2001
Springer
Abstract. Many real-time embedded systems involve a collection of independently executing event-driven code blocks, having hard real-time constraints. Portions of such codes when t...
147
click to vote
ALENEX
2007
15 years 6 months ago
2007
We consider the problem of designing a distributed algorithm that, given an arbitrary connected graph G of nodes with unique labels, converts G into a sorted list of nodes. This a...