1729 search results - page 290 / 346 » Bound Graph Polysemy |
159
Voted
INFOCOM
2009
IEEE
15 years 11 months ago
2009
IEEE
—In this paper, we study an online bipartite matching problem, motivated by applications in wireless communication, content delivery, and job scheduling. In our problem, we have ...
131
click to vote
TCC
2009
Springer
16 years 5 months ago
2009
Springer
: The aim of this paper is to demonstrate the feasibility of authenticated throughput-ecient routing in an unreliable and dynamically changing synchronous network in which the majo...
150
click to vote
FOCS
2007
IEEE
15 years 11 months ago
2007
IEEE
We present a near-optimal reduction from approximately counting the cardinality of a discrete set to approximately sampling elements of the set. An important application of our wo...
142
click to vote
ISSTA
2004
ACM
15 years 10 months ago
2004
ACM
This paper deals with testing of nondeterministic software systems. We assume that a model of the nondeterministic system is given by a directed graph with two kind of vertices: s...
154
Voted
ICFCA
2004
Springer
15 years 10 months ago
2004
Springer
Lattice diagrams, known as Hasse diagrams, have played an ever increasing role in lattice theory and fields that use lattices as a tool. Initially regarded with suspicion, they no...