Sciweavers

667 search results - page 55 / 134
» Approximation algorithms for connected facility location pro...
Sort
View
CEC
2009
IEEE
15 years 4 months ago
Towards connectivity improvement in VANETs using bypass links
VANETs are ad hoc networks in which devices are vehicles moving at high speeds. This kind of network is getting more and more importance since it has many practical and important a...
Bernabé Dorronsoro Díaz, Patricia Ru...
ADHOCNOW
2008
Springer
15 years 6 months ago
Local Maximal Matching and Local 2-Approximation for Vertex Cover in UDGs
We present 1 − approximation algorithms for the maximum matching problem in location aware unit disc graphs and in growth-bounded graphs. The algorithm for unit disk graph is loc...
Andreas Wiese, Evangelos Kranakis
ECCC
2008
98views more  ECCC 2008»
15 years 17 days ago
Public-Key Cryptosystems from the Worst-Case Shortest Vector Problem
We construct public-key cryptosystems that are secure assuming the worst-case hardness of approximating the minimum distance on n-dimensional lattices to within small poly(n) fact...
Chris Peikert
93
Voted
JAT
2010
71views more  JAT 2010»
14 years 11 months ago
Functions with prescribed best linear approximations
A common problem in applied mathematics is that of finding a function in a Hilbert space with prescribed best approximations from a finite number of closed vector subspaces. In ...
Patrick L. Combettes, Noli N. Reyes
CVPR
2009
IEEE
16 years 7 months ago
Global Connectivity Potentials for Random Field Models
Markov random field (MRF, CRF) models are popular in computer vision. However, in order to be computationally tractable they are limited to incorporate only local interactions a...
Sebastian Nowozin, Christoph H. Lampert