5138 search results - page 765 / 1028 » Randomized Algorithms for 3-SAT |
162
click to vote
STOC
2003
ACM
16 years 6 months ago
2003
ACM
Given a database of n points in {0, 1}d, the partial match problem is: In response to a query x in {0, 1, }d, find a database point y such that for every i whenever xi = , we have...
171
click to vote
SDM
2009
SIAM
16 years 3 months ago
2009
SIAM
Recent research in frequent pattern mining (FPM) has shifted from obtaining the complete set of frequent patterns to generating only a representative (summary) subset of frequent ...
173
click to vote
APPROX
2009
Springer
16 years 1 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 ...
213
click to vote
KSEM
2009
Springer
16 years 1 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...
142
click to vote
ICC
2007
IEEE
16 years 27 days ago
2007
IEEE
— Optimal bandwidth utilisation together with resilience and recovery from failure are two key drivers for Traffic Engineering (TE) which have been widely addressed by the IP co...