2489 search results - page 243 / 498 » On the Subgroup Distance Problem |
150
click to vote
SODA
2004
ACM
15 years 6 months ago
2004
ACM
We design polynomial time approximation schemes (PTASs) for Metric BISECTION, i.e. dividing a given finite metric space into two halves so as to minimize or maximize the sum of di...
146
click to vote
WSCG
2004
15 years 6 months ago
2004
This paper presents a new method for realistic real-time rendering of tree foliage. Some approaches to this problem have been presented before but the quality of their results was...
155
click to vote
SODA
1998
ACM
15 years 6 months ago
1998
ACM
Given a planar graph on n nodes with costs weights on its edges, de ne the distance between nodes i and j as the length of the shortest path between i and j. Consider this as an i...
131
click to vote
NIPS
1996
15 years 6 months ago
1996
: Neural networks are competitive tools for classification problems. In this context, a hint is any piece of prior side information about the classification. Common examples are mo...
141
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
We study randomized variants of two classical algorithms: coordinate descent for systems of linear equations and iterated projections for systems of linear inequalities. Expanding...