Sciweavers

145 search results - page 14 / 29
» On finding approximate optimal paths in weighted regions
Sort
View
CEAS
2006
Springer
13 years 11 months ago
Learning at Low False Positive Rates
Most spam filters are configured for use at a very low falsepositive rate. Typically, the filters are trained with techniques that optimize accuracy or entropy, rather than perfor...
Wen-tau Yih, Joshua Goodman, Geoff Hulten
JGAA
2000
179views more  JGAA 2000»
13 years 7 months ago
Approximation Algorithms for Some Graph Partitioning Problems
This paper considers problems of the following type: given an edgeweighted k-colored input graph with maximum color class size c, find a minimum or maximum c-way cut such that eac...
George He, Jiping Liu, Cheng Zhao
MP
2008
135views more  MP 2008»
13 years 7 months ago
A path to the Arrow-Debreu competitive market equilibrium
: We present polynomial-time interior-point algorithms for solving the Fisher and Arrow-Debreu competitive market equilibrium problems with linear utilities and n players. Both of ...
Yinyu Ye
EUROGRAPHICS
2010
Eurographics
14 years 4 months ago
Sketching Clothoid Splines Using Shortest Paths
Clothoid splines are gaining popularity as a curve representation due to their intrinsically pleasing curvature, which varies piecewise linearly over arc length. However, construc...
Ilya Baran, Jaakko Lehtinen, Jovan Popovic
WIOPT
2010
IEEE
13 years 5 months ago
Optimizing power allocation in interference channels using D.C. programming
Abstract--Power allocation is a promising approach for optimizing the performance of mobile radio systems in interference channels. In the present paper, the non-convex objective f...
Hussein Al-Shatri, Tobias Weber