2137 search results - page 191 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
152
click to vote
PODC
2006
ACM
16 years 11 days ago
2006
ACM
This paper presents a distributed algorithm for wireless adhoc networks that runs in polylogarithmic number of rounds in the size of the network and constructs a lightweight, line...
170
click to vote
FOCS
2005
IEEE
16 years 1 days ago
2005
IEEE
In the CLOSEST SUBSTRING problem k strings s1, ..., sk are given, and the task is to find a string s of length L such that each string si has a consecutive substring of length L ...
195
click to vote
COMPGEOM
2004
ACM
15 years 12 months ago
2004
ACM
A frequently arising problem in computational geometry is when a physical structure, such as an ad-hoc wireless sensor network or a protein backbone, can measure local information...
163
click to vote
ISSAC
2009
Springer
16 years 29 days ago
2009
Springer
We present an iterative algorithm for calculating approximate greatest common divisor (GCD) of univariate polynomials with the real coefficients. For a given pair of polynomials a...
184
Voted
NIPS
2004
15 years 7 months ago
2004
Given a directed graph in which some of the nodes are labeled, we investigate the question of how to exploit the link structure of the graph to infer the labels of the remaining u...