1487 search results - page 174 / 298 » The Computational Complexity of Link Building |
131
click to vote
CVPR
2008
IEEE
16 years 6 months ago
2008
IEEE
Visual and non-visual data are often related through complex, indirect links, thus making the prediction of one from the other difficult. Examples include the partiallyunderstood ...
153
click to vote
ECCV
2004
Springer
16 years 6 months ago
2004
Springer
Abstract. Statistical shape and texture appearance models are powerful image representations, but previously had been restricted to 2D or 3D shapes with smooth surfaces and lambert...
257
click to vote
ICLP
2009
Springer
16 years 5 months ago
2009
Springer
We address how to write programs for distributed computing systems in which the network topology can change dynamically. Examples of such systems, which we call ensembles, include ...
116
click to vote
DCC
2001
IEEE
16 years 4 months ago
2001
IEEE
A method for demonstrating and enumerating uniformly efficient (permutation-optimal) trellis decoders for self-dual codes of high minimum distance is developed. Such decoders and c...
142
click to vote
ICDCS
2009
IEEE
16 years 1 months ago
2009
IEEE
We consider the distributed complexity of the stable marriage problem. In this problem, the communication graph is undirected and bipartite, and each node ranks its neighbors. Giv...