Sciweavers

3047 search results - page 88 / 610
» Randomized Parallel Selection
Sort
View
ICCV
2009
IEEE
13 years 7 months ago
Exploiting uncertainty in random sample consensus
In this work, we present a technique for robust estimation, which by explicitly incorporating the inherent uncertainty of the estimation procedure, results in a more efficient rob...
Rahul Raguram, Jan-Michael Frahm, Marc Pollefeys
PDCAT
2004
Springer
14 years 3 months ago
An Adaptive Proximity Route Selection Scheme in DHT-Based Peer to Peer Systems
This paper presents a proximity route selection scheme which is adaptive to the underlying network conditions. The proposed scheme repeatedly estimates and updates the total lookup...
Jiyoung Song, Sungyong Park, Jihoon Yang
DPD
2006
114views more  DPD 2006»
13 years 10 months ago
A novel approach to resource scheduling for parallel query processing on computational grids
Advances in network technologies and the emergence of Grid computing have both increased the need and provided the infrastructure for computation and data intensive applications to...
Anastasios Gounaris, Rizos Sakellariou, Norman W. ...
EGC
2005
Springer
14 years 3 months ago
Automatic Composition and Selection of Semantic Web Services
Interactive applications like Problem Solving Environments require on demand access to Web Services, where the services are autonomously discovered, composed, selected and invocate...
Tor Arne Kvaløy, Erik Rongen, Alfredo Tirad...
WEA
2004
Springer
129views Algorithms» more  WEA 2004»
14 years 3 months ago
Experimental Comparison of Greedy Randomized Adaptive Search Procedures for the Maximum Diversity Problem
Abstract. The maximum diversity problem (MDP) consists of identifying optimally diverse subsets of elements from some larger collection. The selection of elements is based on the d...
Geiza C. Silva, Luiz Satoru Ochi, Simone L. Martin...