273 search results - page 49 / 55 » Can Pure Cutting Plane Algorithms Work |
STOC
2006
ACM
14 years 7 months ago
2006
ACM
Range searching is among the most fundamental problems in computational geometry. An n-element point set in Rd is given along with an assignment of weights to these points from so...
WWW
2008
ACM
14 years 8 months ago
2008
ACM
High-quality, personalized recommendations are a key feature in many online systems. Since these systems often have explicit knowledge of social network structures, the recommenda...
STOC
2010
ACM
14 years 10 days ago
2010
ACM
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
ACL
2006
13 years 9 months ago
2006
In this paper we report our work on building a POS tagger for a morphologically rich language- Hindi. The theme of the research is to vindicate the stand that- if morphology is st...
PODC
2010
ACM
13 years 9 months ago
2010
ACM
We study the computational power of a distributed system consisting of simple autonomous robots moving on the plane. The robots are endowed with visual perception but do not have ...