Sciweavers

450 search results - page 75 / 90
» Estimating Search Tree Size
Sort
View
KIVS
2007
Springer
14 years 1 months ago
Improved Locality-Aware Grouping in Overlay Networks
Abstract The performance of peer-to-peer and overlay networks depends to a great extent on their awareness of the underlying network’s properties. Several schemes for estimating ...
Matthias Scheidegger, Torsten Braun
SIGIR
2006
ACM
14 years 1 months ago
Distributed query sampling: a quality-conscious approach
We present an adaptive distributed query-sampling framework that is quality-conscious for extracting high-quality text database samples. The framework divides the query-based samp...
James Caverlee, Ling Liu, Joonsoo Bae
PE
2010
Springer
170views Optimization» more  PE 2010»
13 years 6 months ago
Approximating passage time distributions in queueing models by Bayesian expansion
We introduce Bayesian Expansion (BE), an approximate numerical technique for passage time distribution analysis in queueing networks. BE uses a class of Bayesian networks to appro...
Giuliano Casale
BIOINFORMATICS
2011
12 years 11 months ago
libfbi: a C++ implementation for fast box intersection and application to sparse mass spectrometry data
Abstract. This document is a preprint of the following publication: Bioinformatics (2011) 27(8): 1166-1167. Algorithms for sparse data require fast search and subset selection capa...
Marc Kirchner, Buote Xu, Hanno Steen, Judith A. J....
IROS
2009
IEEE
214views Robotics» more  IROS 2009»
14 years 2 months ago
1-point RANSAC for EKF-based Structure from Motion
Abstract— Recently, classical pairwise Structure From Motion (SfM) techniques have been combined with non-linear global optimization (Bundle Adjustment, BA) over a sliding window...
Javier Civera, Oscar G. Grasa, Andrew J. Davison, ...