3874 search results - page 619 / 775 » Approximation Algorithms for k-hurdle Problems |
125
click to vote
MSWIM
2005
ACM
15 years 9 months ago
2005
ACM
Emerging multi-hop wireless mesh networks have much different characteristics than the Internet. They have low dimensionality and large diameters. Content and service replication ...
160
click to vote
KDD
2012
ACM
13 years 6 months ago
2012
ACM
Non-negative matrix factorization (NMF) provides a lower rank approximation of a matrix. Due to nonnegativity imposed on the factors, it gives a latent structure that is often mor...
137
click to vote
APPROX
2009
Springer
15 years 10 months ago
2009
Springer
We study the maximization version of the fundamental graph coloring problem. Here the goal is to color the vertices of a k-colorable graph with k colors so that a maximum fraction ...
166
click to vote
KSEM
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Support Vector Machines (SVM) have been applied successfully in a wide variety of fields in the last decade. The SVM problem is formulated as a convex objective function...
153
click to vote
OOPSLA
2005
Springer
15 years 9 months ago
2005
Springer
We present a points-to analysis technique suitable for environments with small time and memory budgets, such as just-in-time (JIT) compilers and interactive development environmen...