Sciweavers

3874 search results - page 438 / 775
» Approximation Algorithms for k-hurdle Problems
Sort
View
DCOSS
2008
Springer
15 years 8 months ago
Local PTAS for Independent Set and Vertex Cover in Location Aware Unit Disk Graphs
We present the first local approximation schemes for maximum independent set and minimum vertex cover in unit disk graphs. In the graph model we assume that each node knows its geo...
Andreas Wiese, Evangelos Kranakis
ESA
2008
Springer
195views Algorithms» more  ESA 2008»
15 years 8 months ago
A Characterization of 2-Player Mechanisms for Scheduling
We study the mechanism design problem of scheduling unrelated machines and we completely characterize the decisive truthful mechanisms for two players when the domain contains bot...
George Christodoulou, Elias Koutsoupias, Angelina ...
CORR
2006
Springer
123views Education» more  CORR 2006»
15 years 6 months ago
Counting good truth assignments of random k-SAT formulae
We present a deterministic approximation algorithm to compute logarithm of the number of `good' truth assignments for a random k-satisfiability (k-SAT) formula in polynomial ...
Andrea Montanari, Devavrat Shah
178
Voted
JCO
2006
103views more  JCO 2006»
15 years 6 months ago
On optimal placement of relay nodes for reliable connectivity in wireless sensor networks
The paper addresses the relay node placement problem in two-tiered wireless sensor networks. Given a set of sensor nodes in Euclidean plane, our objective is to place minimum numbe...
Hai Liu, Peng-Jun Wan, Xiaohua Jia
TIP
2008
128views more  TIP 2008»
15 years 6 months ago
Wavelet Frame Accelerated Reduced Support Vector Machines
In this paper, a novel method for reducing the runtime complexity of a support vector machine classifier is presented. The new training algorithm is fast and simple. This is achiev...
Matthias Rätsch, Gerd Teschke, Sami Romdhani,...