5580 search results - page 836 / 1116 » Randomized priority algorithms |
133
click to vote
APPROX
2009
Springer
15 years 9 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 ...
155
click to vote
KSEM
2009
Springer
15 years 9 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...
106
click to vote
ICC
2007
IEEE
15 years 9 months 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...
154
click to vote
SAC
2006
ACM
15 years 9 months ago
2006
ACM
“The curse of dimensionality” is pertinent to many learning algorithms, and it denotes the drastic raise of computational complexity and classification error in high dimension...
115
click to vote
ESA
2005
Springer
15 years 8 months ago
2005
Springer
Sensor nodes are very weak computers that get distributed at random on a surface. Once deployed, they must wake up and form a radio network. Sensor network bootstrapping research t...