260 search results - page 46 / 52 » Resolution Complexity of Independent Sets in Random Graphs |
EDBT
2008
ACM
15 years 9 months ago
2008
ACM
Scientific data are available through an increasing number of heterogeneous, independently evolving, sources. Although the sources themselves are independently evolving, the data ...
101
click to vote
JSA
2007
14 years 9 months ago
2007
Mapping of applications on a Multiprocessor System-on-Chip (MP-SoC) is a crucial step to optimize performance, energy and memory constraints at the same time. The problem is formu...
120
click to vote
CORR
2010
Springer
14 years 9 months ago
2010
Springer
The overlap number of a finite (d + 1)-uniform hypergraph H is the largest constant c(H) (0, 1] such that no matter how we map the vertices of H into Rd , there is a point covered...
SIGECOM
2005
ACM
15 years 3 months ago
2005
ACM
We study first-price auction mechanisms for auctioning flow between given nodes in a graph. A first-price auction is any auction in which links on winning paths are paid their ...
BIS
2008
14 years 11 months ago
2008
The deep Web has many challenges to be solved. Among them is schema matching. In this paper, we build a conceptual connection between the schema matching problem SMP and the fuzzy ...