172 search results - page 25 / 35 » Improved approximation for directed cut problems |
ECCV
2010
Springer
14 years 1 months ago
2010
Springer
Abstract. In this paper we develop an algorithm for structured prediction that optimizes against complex performance measures, those which are a function of false positive and fals...
INFOCOM
2007
IEEE
14 years 2 months ago
2007
IEEE
— Existing work on placing additional relay nodes in wireless sensor networks to improve network connectivity typically assumes homogeneous wireless sensor nodes with an identica...
COCO
2003
Springer
14 years 28 days ago
2003
Springer
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
SODA
2010
ACM
14 years 5 months ago
2010
ACM
We settle the 1-pass space complexity of (1 ? )approximating the Lp norm, for real p with 1 p 2, of a length-n vector updated in a length-m stream with updates to its coordinate...
ISSAC
2007
Springer
14 years 1 months ago
2007
Springer
We describe some major recent progress in exact and symbolic linear algebra. These advances concern the improvement of complexity estimates for fundamental problems such as linear...