Sciweavers

3055 search results - page 157 / 611
» Randomized Search Trees
Sort
View
KBSE
2002
IEEE
14 years 3 months ago
What Makes Finite-State Models More (or Less) Testable?
Finite-state machine (FSM) models are commonly used to represent software with concurrent processes. Established model checking tools can be used to automatically test FSM models,...
David Owen, Tim Menzies, Bojan Cukic
CIVR
2010
Springer
299views Image Analysis» more  CIVR 2010»
14 years 1 months ago
Co-reranking by mutual reinforcement for image search
Most existing reranking approaches to image search focus solely on mining "visual" cues within the initial search results. However, the visual information cannot always ...
Ting Yao, Tao Mei, Chong-Wah Ngo
ICPR
2004
IEEE
14 years 12 months ago
Pose Clustering Guided by Short Interpretation Trees
It is common in object recognition algorithms based on viewpoint consistency to find object poses that align many of the object features with features extracted from a search imag...
Clark F. Olson
VTC
2010
IEEE
178views Communications» more  VTC 2010»
13 years 9 months ago
Nonparametric Belief Propagation Based on Spanning Trees for Cooperative Localization in Wireless Sensor Networks
—Nonparametric belief propagation (NBP) is one of the best-known methods for cooperative localization in sensor networks. It is capable to provide information about location esti...
Vladimir Savic, Santiago Zazo
BERTINORO
2005
Springer
14 years 4 months ago
Design and Analysis of a Bio-inspired Search Algorithm for Peer to Peer Networks
Decentralized peer to peer (p2p) networks like Gnutella are attractive for certain applications because they require no centralized directories and no precise control over network ...
Niloy Ganguly, Lutz Brusch, Andreas Deutsch