Sciweavers

40 search results - page 8 / 8
» approx 2006
Sort
View
APPROX
2006
Springer
234views Algorithms» more  APPROX 2006»
13 years 8 months ago
Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs
For a given graph with weighted vertices, the goal of the minimum-weight dominating set problem is to compute a vertex subset of smallest weight such that each vertex of the graph...
Christoph Ambühl, Thomas Erlebach, Matú...
APPROX
2006
Springer
109views Algorithms» more  APPROX 2006»
13 years 8 months ago
Dobrushin Conditions and Systematic Scan
We consider Glauber dynamics on finite spin systems. The mixing time of Glauber dynamics can be bounded in terms of the influences of sites on each other. We consider three parame...
Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum
CIVR
2007
Springer
139views Image Analysis» more  CIVR 2007»
13 years 11 months ago
Video search in concept subspace: a text-like paradigm
Though both quantity and quality of semantic concept detection in video are continuously improving, it still remains unclear how to exploit these detected concepts as semantic ind...
Xirong Li, Dong Wang, Jianmin Li, Bo Zhang
APPROX
2006
Springer
88views Algorithms» more  APPROX 2006»
13 years 8 months ago
Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs
Motivated by applications in batch scheduling of jobs in manufacturing systems and distributed computing, we study two related problems. Given is a set of jobs {J1, . . . , Jn}, w...
Leah Epstein, Magnús M. Halldórsson,...
TCC
2007
Springer
100views Cryptology» more  TCC 2007»
13 years 10 months ago
Private Approximation of Clustering and Vertex Cover
Private approximation of search problems deals with finding approximate solutions to search problems while disclosing as little information as possible. The focus of this work is ...
Amos Beimel, Renen Hallak, Kobbi Nissim