Sciweavers

5624 search results - page 415 / 1125
» On Conditional Covering Problem
Sort
View
188
Voted
SIGECOM
2006
ACM
138views ECommerce» more  SIGECOM 2006»
16 years 25 days ago
Bid expressiveness and clearing algorithms in multiattribute double auctions
We investigate the space of two-sided multiattribute auctions, focusing on the relationship between constraints on the offers traders can express through bids, and the resulting c...
Yagil Engel, Michael P. Wellman, Kevin M. Lochner
170
Voted
JC
2010
117views more  JC 2010»
15 years 1 months ago
Tractability through increasing smoothness
We prove that some multivariate linear tensor product problems are tractable in the worst case setting if they are defined as tensor products of univariate problems with logarithm...
Anargyros Papageorgiou, Henryk Wozniakowski
172
Voted
ICPR
2008
IEEE
16 years 8 months ago
Structural poisson mixtures for classification of documents
Considering the statistical text classification problem we approximate class-conditional probability distributions by structurally modified Poisson mixtures. By introducing the st...
Jana Novovicová, Jiri Grim, Petr Somol
STOC
2002
ACM
115views Algorithms» more  STOC 2002»
16 years 7 months ago
Stability of load balancing algorithms in dynamic adversarial systems
In the dynamic load balancing problem, we seek to keep the job load roughly evenly distributed among the processors of a given network. The arrival and departure of jobs is modeled...
Elliot Anshelevich, David Kempe, Jon M. Kleinberg
ICASSP
2008
IEEE
16 years 1 months ago
On quantifying the effects of noncircularity on the complex fastica algorithm
The complex fast independent component analysis (c-FastICA) algorithm is one of the most popular methods for solving the ICA problem with complex-valued data. In this study, we ex...
Mike Novey, Tülay Adali