Sciweavers

5595 search results - page 722 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
INFOCOM
2010
IEEE
15 years 5 months ago
MIMO-Aware Routing in Wireless Mesh Networks
Abstract—Multiple-input and multiple-output (MIMO) technique is considered as one of the most promising emerging wireless technologies that can significantly improve transmissio...
Shan Chu, Xin Wang
CEAS
2006
Springer
15 years 10 months ago
Fast Uncertainty Sampling for Labeling Large E-mail Corpora
One of the biggest challenges in building effective anti-spam solutions is designing systems to defend against the everevolving bag of tricks spammers use to defeat them. Because ...
Richard Segal, Ted Markowitz, William Arnold
CORR
2011
Springer
215views Education» more  CORR 2011»
14 years 10 months ago
The Bethe Permanent of a Non-Negative Matrix
:  The Bethe Permanent of a Non-Negative Matrix Pascal O. Vontobel HP Laboratories HPL-2011-116 Bethe approximation; Bethe permanent; graph cover; partition function; perfect ma...
Pascal O. Vontobel
191
Voted
WINE
2005
Springer
182views Economy» more  WINE 2005»
16 years 9 days ago
Inapproximability Results for Combinatorial Auctions with Submodular Utility Functions
We consider the following allocation problem arising in the setting of combinatorial auctions: a set of goods is to be allocated to a set of players so as to maximize the sum of t...
Subhash Khot, Richard J. Lipton, Evangelos Markaki...
ISSAC
1995
Springer
174views Mathematics» more  ISSAC 1995»
15 years 10 months ago
Numerical Uniformization of Hyperelliptic Curves
Abstract. In this paper we derive an algorithm that computes, for a given algebraic hyperelliptic plane curve C of genus p, p > 1, defined by a polynomial y2 = (x−λ1) · · ...
Klaus-Dieter Semmler, Mika Seppälä