358 search results - page 17 / 72 » On the Distributed Complexity of Computing Maximal Matchings |
144
Voted
CVPR
2009
IEEE
16 years 8 months ago
2009
IEEE
We describe a novel and robust feature descriptor called ordinal spatial intensity distribution (OSID) which is invariant to any monotonically increasing brightness changes. Many t...
115
Voted
ICCV
2009
IEEE
16 years 6 months ago
2009
IEEE
We present a system that can match and reconstruct 3D
scenes from extremely large collections of photographs such
as those found by searching for a given city (e.g., Rome) on
In...
139
click to vote
WDAG
2001
Springer
15 years 6 months ago
2001
Springer
Abstract. The ability to cooperate on common tasks in a distributed setting is key to solving a broad range of computation problems ranging from distributed search such as SETI to ...
118
click to vote
AAAI
2012
13 years 4 months ago
2012
In many dynamic matching applications—especially high-stakes ones—the competitive ratios of prior-free online algorithms are unacceptably poor. The algorithm should take distr...
128
click to vote
IPPS
2010
IEEE
14 years 11 months ago
2010
IEEE
In this paper, we investigate the roles of replication vs. repair to achieve durability in large-scale distributed storage systems. Specifically, we address the fundamental questio...