320 search results - page 51 / 64 » Rigorous Result for the CHKNS Random Graph Model |
CIVR
2010
Springer
13 years 11 months ago
2010
Springer
Most existing reranking approaches to image search focus solely on mining "visual" cues within the initial search results. However, the visual information cannot always ...
CVPR
2005
IEEE
14 years 10 months ago
2005
IEEE
In this paper we present a principled Bayesian method for detecting and segmenting instances of a particular object category within an image, providing a coherent methodology for ...
RANDOM
1998
Springer
14 years 21 days ago
1998
Springer
Abstract. Redundancy has been utilized to achieve fault tolerant computation and to achieve reliable communication in networks of processors. These techniques can only be extended ...
SIAMDM
2008
13 years 8 months ago
2008
In this paper we consider the problem of testing whether a graph is triangle-free, and more generally, whether it is H-free, for a fixed subgraph H. The algorithm should accept gr...
MIDDLEWARE
2004
Springer
14 years 1 months ago
2004
Springer
Simulation studies are frequently used to evaluate new peer-to-peer searching techniques as well as existing techniques on new applications. Unless these studies are accurate in th...