99 search results - page 13 / 20 » Approximation algorithms and hardness of integral concurrent... |
CODES
2009
IEEE
13 years 11 months ago
2009
IEEE
Field-Programmable Gate Arrays (FPGAs) have become promising mapping fabric for the implementation of System-on-Chip (SoC) platforms, due to their large capacity and their enhance...
ECCC
2007
13 years 6 months ago
2007
In the undirected Edge-Disjoint Paths problem with Congestion (EDPwC), we are given an undirected graph with V nodes, a set of terminal pairs and an integer c. The objective is to...
SIGMOD
2007
ACM
14 years 7 months ago
2007
ACM
Declarative data quality has been an active research topic. The fundamental principle behind a declarative approach to data quality is the use of declarative statements to realize...
STOC
2006
ACM
14 years 7 months ago
2006
ACM
Unique games are constraint satisfaction problems that can be viewed as a generalization of Max-Cut to a larger domain size. The Unique Games Conjecture states that it is hard to ...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted ...