5624 search results - page 628 / 1125 » On Conditional Covering Problem |
168
click to vote
WIOPT
2005
IEEE
16 years 2 days ago
2005
IEEE
We study power control in multicell CDMA wireless networks as a team optimization problem where each mobile attains at the minimum its individual fixed target SIR level and beyon...
180
click to vote
FORMATS
2005
Springer
16 years 1 days ago
2005
Springer
In this paper, we study timed games played on weighted timed automata. In this context, the reachability problem asks if, given a set T of locations and a cost C, Player 1 has a st...
177
click to vote
SLSFS
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. Matrix factorization is a fundamental building block in many computer vision and machine learning algorithms. In this work we focus on the problem of ”structure from mo...
168
click to vote
ICALP
2004
Springer
15 years 12 months ago
2004
Springer
We present a domain-theoretic version of Picard’s theorem for solving classical initial value problems in Rn . For the case of vector fields that satisfy a Lipschitz condition, ...
198
click to vote
FOCS
2002
IEEE
15 years 11 months ago
2002
IEEE
Abstract—This paper generalizes the classical Knuth–Schönhage algorithm computing the greatest common divisor (gcd) of two polynomials for solving arbitrary linear Diophantine...