1092 search results - page 161 / 219 » Convex Methods for Transduction |
NIPS
2004
13 years 11 months ago
2004
We propose a new method for clustering based on finding maximum margin hyperplanes through data. By reformulating the problem in terms of the implied equivalence relation matrix, ...
WSCG
2004
13 years 11 months ago
2004
Collision detection between moving objects is an open question which raises major problems concerning its algorithmic complexity. In this paper we present a polygon collision dete...
SIGIR
2010
ACM
13 years 10 months ago
2010
ACM
In recent years, active learning methods based on experimental design achieve state-of-the-art performance in text classification applications. Although these methods can exploit ...
ECCC
2006
13 years 10 months ago
2006
We introduce a new algorithm and a new analysis technique that is applicable to a variety of online optimization scenarios, including regret minimization for Lipschitz regret func...
MP
2008
13 years 10 months ago
2008
: We present polynomial-time interior-point algorithms for solving the Fisher and Arrow-Debreu competitive market equilibrium problems with linear utilities and n players. Both of ...