511 search results - page 83 / 103 » Lower bounds for distributed markov chain problems |
ICDCS
2012
IEEE
11 years 10 months ago
2012
IEEE
—Cloud resources are usually priced in multiple markets with different service guarantees. For example, Amazon EC2 prices virtual instances under three pricing schemes — the su...
CVPR
2011
IEEE
13 years 3 months ago
2011
IEEE
Shape matching has many applications in computer vision, such as shape classification, object recognition, object detection, and localization. In 2D cases, shape instances are 2D c...
ECCV
2002
Springer
14 years 9 months ago
2002
Springer
Sequential random sampling (`Markov Chain Monte-Carlo') is a popular strategy for many vision problems involving multimodal distributions over high-dimensional parameter spac...
INFOCOM
2011
IEEE
12 years 11 months ago
2011
IEEE
—Cognitive radios (CRs) can mitigate the impending spectrum scarcity problem by utilizing their capability of accessing licensed spectrum bands opportunistically. While most exis...
STOC
2006
ACM
14 years 8 months ago
2006
ACM
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs s1t1, s2t2, . . ., sktk, the goal is to maximize the number of pairs t...