760 search results - page 133 / 152 » Algorithms for finding clique-transversals of graphs |
SODA
2004
ACM
13 years 9 months ago
2004
ACM
We consider the problem of picking (buying) an inexpensive s-t path in a graph where edges are owned by independent (selfish) agents, and the cost of an edge is known to its owner...
JAIR
2006
13 years 7 months ago
2006
In a peer-to-peer inference system, each peer can reason locally but can also solicit some of its acquaintances, which are peers sharing part of its vocabulary. In this paper, we ...
PERCOM
2010
ACM
13 years 6 months ago
2010
ACM
In this paper, we explore how to effectively create and use "instant mesh networks", i.e., wireless mesh networks that are dynamically deployed in temporary circumstances...
CVPR
2010
IEEE
13 years 5 months ago
2010
IEEE
We investigate how to discover all common visual patterns within two sets of feature points. Common visual patterns generally share similar local features as well as similar spati...
INFOCOM
2002
IEEE
14 years 14 days ago
2002
IEEE
— Directional antennas can be useful in significantly increasing node and network lifetime in wireless ad hoc networks. In order to utilize directional antennas, an algorithm is ...