4526 search results - page 11 / 906 » Algorithmic problems related to the Internet |
NETWORKS
2006
13 years 8 months ago
2006
Abstract. The Steiner tree problem is to find a shortest subgraph that spans a given set of vertices in a graph. This problem is known to be NP-hard and it is well known that a pol...
IJCAI
2007
13 years 10 months ago
2007
A key issue in artificial intelligence lies in finding the amount of input detail needed to do successful learning. Too much detail causes overhead and makes learning prone to ove...
STOC
1998
ACM
14 years 25 days ago
1998
ACM
In the k-median problem we are given a set S of n points in a metric space and a positive integer k. We desire to locate k medians in space, such that the sum of the distances fro...
ALT
2011
Springer
12 years 8 months ago
2011
Springer
We consider the problem of learning sparse parities in the presence of noise. For learning parities on r out of n variables, we give an algorithm that runs in time poly log 1 δ , ...
ESA
2009
Springer
14 years 3 months ago
2009
Springer
Bose et al. [2] asked whether for every simple arrangement A of n lines in the plane there exists a simple n-gon P that induces A by extending every edge of P into a line. We prov...