1055 search results - page 54 / 211 » Convex Factorization Machines |
104
Voted
FOCS
2009
IEEE
15 years 7 months ago
2009
IEEE
We prove the existence of an algorithm A for computing 2-d or 3-d convex hulls that is optimal for every point set in the following sense: for every set S of n points and for ever...
113
click to vote
COLT
2005
Springer
15 years 6 months ago
2005
Springer
We present a general decomposition algorithm that is uniformly applicable to every (suitably normalized) instance of Convex Quadratic Optimization and efficiently approaches an o...
114
click to vote
ESA
2009
Springer
15 years 5 months ago
2009
Springer
Let (S, d) be a finite metric space, where each element p ∈ S has a non-negative weight w(p). We study spanners for the set S with respect to weighted distance function dw, wher...
SAT
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. Restart strategies are an important factor in the performance of conflict-driven Davis Putnam style SAT solvers. Selecting a good restart strategy for a problem instance...
101
Voted
CORR
2002
Springer
15 years 11 days ago
2002
Springer
We consider the problem of classifying documents not by topic, but by overall sentiment, e.g., determining whether a review is positive or negative. Using movie reviews as data, w...