5595 search results - page 924 / 1119 » Approximation Algorithms for Clustering Problems |
174
Voted
VLDB
2005
ACM
16 years 15 days ago
2005
ACM
The largest databases in use today are so large that answering a query exactly can take minutes, hours, or even days. One way to address this problem is to make use of approximati...
169
click to vote
WABI
2005
Springer
16 years 15 days ago
2005
Springer
d Abstract] Tamir Tuller , Efrat Oron , Erez Makavy , Daniel A. Chamovitz † , and Benny Chor ‡ Tel-Aviv University, Tel-Aviv 69978, Israel. Abstract. We study gene expression d...
195
click to vote
ICCV
2003
IEEE
16 years 9 days ago
2003
IEEE
This paper addresses the problem of computing the trajectory of a camera from sparse positional measurements that have been obtained from visual localisation, and dense differenti...
189
Voted
ATAL
2003
Springer
16 years 7 days ago
2003
Springer
Much emphasis in multiagent reinforcement learning (MARL) research is placed on ensuring that MARL algorithms (eventually) converge to desirable equilibria. As in standard reinfor...
216
Voted
FOCS
2002
IEEE
15 years 12 months ago
2002
IEEE
We consider the problem of testing 3-colorability in the bounded-degree model. We show that, for small enough ε, every tester for 3colorability must have query complexity Ω(n)....