1163 search results - page 119 / 233 » Embedding into Bipartite Graphs |
INFOCOM
2010
IEEE
13 years 6 months ago
2010
IEEE
—Efficient operation of wireless networks and switches requires using simple (and in some cases distributed) scheduling algorithms. In general, simple greedy algorithms (known a...
AC
2000
Springer
14 years 16 days ago
2000
Springer
The management of large databases of hierarchical (e.g., multi-scale or multilevel) image features is a common problem in object recognition. Such structures are often represented ...
STOC
2003
ACM
14 years 8 months ago
2003
ACM
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
VLDB
2005
ACM
14 years 1 months ago
2005
ACM
A fundamental concern of information integration in an XML context is the ability to embed one or more source documents in a target document so that (a) the target document confor...
ICALP
2009
Springer
14 years 8 months ago
2009
Springer
We examine several online matching problems, with applications to Internet advertising reservation systems. Consider an edge-weighted bipartite graph G, with partite sets L, R. We...