1208 search results - page 7 / 242 » Uniform eventown problems |
FSTTCS
2010
Springer
14 years 9 months ago
2010
Springer
A fundamental problem in numerical computation and computational geometry is to determine the sign of arithmetic expressions in radicals. Here we consider the simpler problem of d...
ORL
1998
14 years 11 months ago
1998
This paper considers the problem of preemptive on-line scheduling for two uniform processors in which one of the
FOCM
2008
14 years 11 months ago
2008
Smale's 17th Problem asks "Can a zero of n complex polynomial equations in n unknowns be found approximately, on the average [for a suitable probability measure on the s...
104
click to vote
JMLR
2010
14 years 6 months ago
2010
The problem of characterizing learnability is the most basic question of statistical learning theory. A fundamental and long-standing answer, at least for the case of supervised c...
101
click to vote
IPCO
2010
14 years 10 months ago
2010
We consider the facility location problem where each facility can serve at most U clients. We analyze a local search algorithm for this problem which uses only the operations of ad...