Sciweavers

218 search results - page 26 / 44
» Subexponential Algorithms for Unique Games and Related Probl...
Sort
View
ACSC
2007
IEEE
14 years 2 months ago
Mutually Visible Agents in a Discrete Environment
As computer controlled entities are set to move and explore more complex environments they need to be able to perform navigation tasks, like finding minimal cost routes. Much wor...
Joel Fenwick, Vladimir Estivill-Castro
ICALP
2010
Springer
14 years 1 months ago
On the Inapproximability of Vertex Cover on k-Partite k-Uniform Hypergraphs
Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex c...
Venkatesan Guruswami, Rishi Saket
CORR
2010
Springer
165views Education» more  CORR 2010»
13 years 8 months ago
Coalition Formation Games for Distributed Cooperation Among Roadside Units in Vehicular Networks
Vehicle-to-roadside (V2R) communications enable vehicular networks to support a wide range of applications for enhancing the efficiency of road transportation. While existing work...
Walid Saad, Zhu Han, Are Hjørungnes, Dusit ...
JMIV
2007
143views more  JMIV 2007»
13 years 8 months ago
Measures for Benchmarking of Automatic Correspondence Algorithms
Automatic localisation of correspondences for the construction of Statistical Shape Models from examples has been the focus of intense research during the last decade. Several alg...
Anders Ericsson, Johan Karlsson
BMCBI
2007
216views more  BMCBI 2007»
13 years 8 months ago
A replica exchange Monte Carlo algorithm for protein folding in the HP model
Background: The ab initio protein folding problem consists of predicting protein tertiary structure from a given amino acid sequence by minimizing an energy function; it is one of...
Chris Thachuk, Alena Shmygelska, Holger H. Hoos